A shuffled complex evolution algorithm with opposition-based learning for a permutation flow shop scheduling problem
Authors:
- Fuqing ZhaoFZFuqing Zhao
- Jianlin ZhangJZJianlin Zhang
- Junbiao WangJWJunbiao Wang
- Chuck ZhangCZChuck Zhang
- 1 October 2014
- journal article
- Published by Taylor & Francis in International Journal of Computer Integrated Manufacturing
- Vol. 28 (11) , 1-16
Abstract
The permutation flow shop scheduling problem PFSP is a typical non-deterministic polynomial-time hard problem, which has wide engineering applications, and performs an important function in manufacturing fields. In this paper, an improved shuffled complex evolution algorithm with opposition-based learning SCE-OBL was proposed to obtain the optimal makespan for permutation flow shop scheduling. The OBL strategy was used to improve the population quality and accelerate the convergence speed. The theoretical analysis demonstrated that the improved algorithm converged to optimum with a probability of 1. Moreover, the largest-order-value mechanism was used in the combinational optimisation problem to change the variables in the continuous domain to discrete variables, and job-based representation was adopted for encoding the solution of the PFSP. Twenty-nine typical instances were then used to test the performance of the SCE-OBL, and the computational results showed that the SCE-OBL algorithm could obtain better solutions for the PFSP than other algorithms.Keywords
This publication has 57 references indexed in Scilit:
- An efficient tabu search algorithm for the distributed permutation flowshop scheduling problemInternational Journal of Production Research, 2013
- A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardinessInternational Journal of Production Research, 2013
- Permutation flow shop scheduling with order acceptance and weighted tardinessApplied Mathematics and Computation, 2012
- Improving the shuffled complex evolution scheme for optimization of complex nonlinear hydrological systems: Application to the calibration of the Sacramento soil‐moisture accounting modelWater Resources Research, 2010
- Minimising total flow time in permutation flow shop scheduling using a simulated annealing-based approachInternational Journal of Automation and Control, 2010
- Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithmSoft Computing, 2007
- A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup timesIIE Transactions, 1999
- Efficient subspace probabilistic parameter optimization for catchment modelsWater Resources Research, 1997
- Optimal use of the SCE-UA global optimization method for calibrating watershed modelsJournal of Hydrology, 1994
- Calibration of rainfall‐runoff models: Application of global optimization to the Sacramento Soil Moisture Accounting ModelWater Resources Research, 1993