A DE-based approach to no-wait flow-shop scheduling

This paper proposes an effective hybrid differential evolution (HDE) for the no-wait flow-shop scheduling problem (FSSP) with the makespan criterion, which is a typical NP-hard combinational optimization problem. Firstly, a largest-order-value (LOV) rule is presented to transform individuals in DE from real vectors to job permutations so that the DE can be applied for solving FSSPs. Secondly, the DE-based parallel evolution mechanism and framework is applied to perform effective exploration, and a simple but efficient local search developed according to the landscape of FSSP is applied to emphasize problem-dependent local exploitation. Thirdly, a speed-up evaluation method and a fast Insert-based neighborhood examining method are developed based on the properties of the no-wait FSSPs. Due to the hybridization of DE-based evolutionary search and problem-dependent local search as well as the utilization of the speed-up evaluation and fast neighborhood examining, the no-wait FSSPs can be solved efficiently and effectively. Simulations and comparisons based on well-known benchmarks demonstrate the efficiency, effectiveness, and robustness of the proposed HDE.

[1]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[2]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[3]  Edy Bertolissi,et al.  Heuristic algorithm for scheduling in the no-wait flow-shop , 2000 .

[4]  Joni-Kristian Kämäräinen,et al.  Differential Evolution Training Algorithm for Feed-Forward Neural Networks , 2003, Neural Processing Letters.

[5]  D. Chaudhuri,et al.  Heuristic algorithms for continuous flow-shop problem , 1990 .

[6]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[7]  Jack Heller,et al.  Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects , 1960 .

[8]  William E. Hart,et al.  Recent Advances in Memetic Algorithms , 2008 .

[9]  Ling Wang,et al.  An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..

[10]  Eugeniusz Nowicki,et al.  Some aspects of scatter search in the flow-shop problem , 2006, Eur. J. Oper. Res..

[11]  Natalio Krasnogor,et al.  Studies on the theory and design space of memetic algorithms , 2002 .

[12]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[13]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[14]  Hartmut Stadtler,et al.  Supply chain management and advanced planning--basics, overview and challenges , 2005, Eur. J. Oper. Res..

[15]  Ali M. S. Zalzala,et al.  Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons , 2000, IEEE Trans. Evol. Comput..

[16]  Tariq A. Aldowaisan,et al.  NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME , 2004 .

[17]  T. P. Bagchi,et al.  Lot streaming and scheduling heuristics for m -machine no-wait flowshops , 2000 .

[18]  Jose M. Framiñan,et al.  Approximative procedures for no-wait job shop scheduling , 2003, Oper. Res. Lett..

[19]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[20]  Ali Allahverdi,et al.  No-wait flowshops with bicriteria of makespan and maximum lateness , 2004, Eur. J. Oper. Res..

[21]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[22]  Ali Allahverdi,et al.  New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..

[23]  Mehmet Sevkli,et al.  Differential Evolution Algorithm for Permutation Flowshop Sequencing Problem with Makespan Criterion , 2004 .

[24]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[25]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[26]  Chuen-Lung Chen,et al.  Genetic algorithms applied to the continuous flow shop problem , 1996 .

[27]  Andreas C. Nearchou,et al.  A differential evolution approach for the common due date early/tardy job scheduling problem , 2008, Comput. Oper. Res..

[28]  Józef Grabowski,et al.  Some local search algorithms for no-wait flow-shop problem with makespan criterion , 2005, Comput. Oper. Res..

[29]  Maxim Sviridenko,et al.  Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme , 2003, SIAM J. Discret. Math..

[30]  Kevin Kok Wai Wong,et al.  Classification of adaptive memetic algorithms: a comparative study , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[31]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[32]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[33]  Chandrasekharan Rajendran,et al.  A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .

[34]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[35]  Ling Wang,et al.  An effective hybrid particle swarm optimization for no-wait flow shop scheduling , 2007 .

[36]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[37]  Thomas Stützle,et al.  A review of metrics on permutations for search landscape analysis , 2007, Comput. Oper. Res..

[38]  C. Rajendran,et al.  Heuristic algorithms for scheduling in the no-wait flowshop , 1993 .

[39]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[40]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

[41]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[42]  Jacques Carlier,et al.  Ordonnancements à contraintes disjonctives , 1978 .

[43]  Chyi Hwang,et al.  Design of Digital PID Controllers for Continuous-Time Plants with Integral Performance Criteria , 2004 .

[44]  C. R. Reeves,et al.  Landscapes, operators and heuristic search , 1999, Ann. Oper. Res..

[45]  Mehmet Fatih Tasgetiren,et al.  Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem , 2004, ANTS Workshop.

[46]  K. R. Baker,et al.  Minimizing Mean Flowtime in the Flow Shop with No Intermediate Queues , 1974 .

[47]  Chi-Jui Wu,et al.  Optimal multiobjective planning of large-scale passive harmonic filters using hybrid differential evolution method considering parameter and loading uncertainty , 2005 .