A Quantum-inspired Iterated Greedy algorithm for permutation flowshops in a collaborative manufacturing environment

References

• Allahverdi , A. and Aldowaisan , T. 2002 . New heuristics to minimize total completion time in m-machine flowshops . International Journal of Production Economics , 77 ( 1 ) : 71 – 83 .
   Web of Science ®Google Scholar
• Aytug , H. 2005 . Executing production schedules in the face of uncertainties: a review and some future directions . European Journal of Operational Research , 161 : 86 – 110 .
   Web of Science ®Google Scholar
• Cybenco , G. 2001 . Reducing quantum computations to elementary unitary operations . Computing in Science and Engineering , 3 ( 2 ) : 27 – 32 .
   Web of Science ®Google Scholar
• Dong , X. , Huang , H. and Chen , P. 2009 . An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion . Computers and Operations Research , 36 : 1664 – 1669 .
   Web of Science ®Google Scholar
• Draa , A. , Batouche , M. and Talbi , H. 2004 . A quantum-inspired differential evolution algorithm for rigid image registration . Enformatika Transactions on Engineering, Computing and Technology , 11 : 408 – 411 .
   Google Scholar
• Framinan , J. M. and Leisten , R. 2003 . An efficient constructive heuristic for flowtime minimisation in permutation flow shops . OMEGA , 31 ( 4 ) : 311 – 317 .
   Web of Science ®Google Scholar
• Framinan , J. M. , Leisten , R. and Ruiz-Usano , R. 2005 . Comparison of heuristics for flowtime minimisation in permutation flowshops . Computers and Operations Research , 32 : 1237 – 1254 .
   Web of Science ®Google Scholar
• Gray , M. R. , Johnson , D. S. and Sethi , R. 1976 . The complexity of flowshop and jobshop scheduling . Mathematics of Operations Research , 1 ( 2 ) : 117 – 129 .
   Google Scholar
• Han , K. H. and Kim , J. H. 2002 . Quantum-inspired evolutionary algorithm for a class of combinatorial optimization . IEEE Transactions on Evolutionary Computation , 6 ( 6 ) : 580 – 593 .
   Web of Science ®Google Scholar
• Han , K. H. and Kim , J. H. 2004 . Quantum-inspired evolutionary algorithms with a new termination criterion, He gate, and two-phase scheme . IEEE Transactions on Evolutionary Computation , 2 ( 8 ) : 156 – 169 .
   Web of Science ®Google Scholar
• Ishibuchi , H. and Murata , T. 1998 . A multi-objective genetic local search algorithm and its application to flowshop scheduling . IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Reviews , 28 ( 3 ) : 392 – 403 .
   Web of Science ®Google Scholar
• Ishibuchi , H. , Yoshida , T. and Murata , T. 2003 . Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling . IEEE Transactions on Evolutionary Computation , 7 ( 2 ) : 204 – 223 .
   Web of Science ®Google Scholar
• Jarboui , B. , Eddaly , M. and Siarry , P. 2009 . An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems . Computers and Operations Research , 36 : 2638 – 2646 .
   Web of Science ®Google Scholar
• Jarboui , B. 2008 . A combinatorial particle swarm optimisation for solving permutation flowshop problems . Computers and Industrial Engineering , 54 : 526 – 538 .
   Web of Science ®Google Scholar
• Johnson , S. M. 1954 . Optimal two-and three-state production schedules with setup times included . Naval Research Logistics Quarterly , 1 : 61 – 68 .
   Google Scholar
• Kim , Y. 1995 . Minimizing total tardiness in permutation flowshops . European Journal of Operational Research , 85 ( 3 ) : 541 – 555 .
   Web of Science ®Google Scholar
• Li , X. , Wang , Q. and Wu , C. 2009 . Efficient composite heuristics for total flowtime minimization in permutation flow shops . OMEGA , 37 ( 1 ) : 155 – 164 .
   Web of Science ®Google Scholar
• Li , Z. and Ierapetritou , M. 2008 . Process scheduling under uncertainty: review and challenges . Computers and Chemical Engineering , 32 : 715 – 727 .
   Web of Science ®Google Scholar
• Liu , J. and Reeves , C. R. 2001 . Constructive and composite heuristic solutions to the P//ΣCi scheduling problem . European Journal of Operational Research , 132 : 439 – 452 .
   Web of Science ®Google Scholar
• Murata , T. , Ishibuchi , H. and Tanaka , H. 1996 . Multi-objective genetic algorithm and its applications to flowshop scheduling . Computers and Industrial Engineering , 30 ( 4 ) : 957 – 968 .
   Web of Science ®Google Scholar
• Nawaz , M. , Enscore , E. E. and Ham , I. 1983 . A heuristic algorithm for the m-machine n-job flow-shop sequencing problem . OMEGA , 11 ( 1 ) : 91 – 95 .
   Web of Science ®Google Scholar
• Pan , Q. K. , Tasgetiren , M. F. and Liang , Y. C. 2008 . A discrete differential evolution algorithm for the permutation flowshop scheduling problem . Computers and Industrial Engineering , 55 : 795 – 816 .
   Web of Science ®Google Scholar
• Potts , C. N. and Van Wassenhove , L. N. 1985 . A branch-and-bound algorithm for the total weighted tardiness problem . Operations Research , 33 ( 2 ) : 363 – 377 .
   Web of Science ®Google Scholar
• Rajendran , C. 1994 . A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria . International Journal of Production Research , 32 : 2541 – 2558 .
   Web of Science ®Google Scholar
• Rajendran , C. and Ziegler , H. 1997 . An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs . European Journal of Operational Research , 103 ( 1 ) : 129 – 138 .
   Web of Science ®Google Scholar
• Rajendran , C. and Ziegler , H. 2004 . Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs . European Journal of Operation Research , 115 : 426 – 438 .
   Web of Science ®Google Scholar
• Rajendran , C. and Ziegler , H. 2005 . Two ant-colony algorithms for minimizing total flowtime in permutation flowshops . Computers and Industrial Engineering , 48 : 789 – 797 .
   Web of Science ®Google Scholar
• Rajkumar , R. and Shahabudeen , P. 2009 . Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs . International Journal of Computer Integrated Manufacturing , 22 ( 10 ) : 987 – 998 .
   Web of Science ®Google Scholar
• Ruiz , R. , Maroto , C. and Alcaraz , J. 2006 . Two new robust genetic algorithms for the flowshop scheduling problem . OMEGA , 34 : 461 – 476 .
   Web of Science ®Google Scholar
• Ruiz , R. and Stützle , T. 2007 . A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem . European Journal of Operational Research , 177 : 2033 – 2049 .
   Web of Science ®Google Scholar
• Ruiz , R. and Stützle , T. 2008 . An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives . European Journal of Operational Research , 187 : 1143 – 1159 .
   Web of Science ®Google Scholar
• Taillard , E. 1993 . Benchmarks for basic scheduling problems . European Journal of Operational Research , 64 ( 1 ) : 278 – 285 .
   Web of Science ®Google Scholar
• Tan , K. 2000 . A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times . OMEGA , 28 : 313 – 326 .
   Web of Science ®Google Scholar
• Tasgetiren , M. 2007 . A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem . European Journal of Operational Research , 177 : 1930 – 1947 .
   Web of Science ®Google Scholar
• Tseng , L. Y. and Lin , Y. T. 2009 . A hybrid genetic local search algorithm for the permutation flowshop scheduling problem . European Journal of Operational Research , 198 : 84 – 92 .
   Web of Science ®Google Scholar
• Tseng , L. Y. and Lin , Y. T. 2010 . A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem . International Journal of Production Economics , 127 : 121 – 128 .
   Web of Science ®Google Scholar
• Vlachogiannis , J. G. and Lee , K. Y. 2008 . Quantum-inspired evolutionary algorithm for real and reactive power dispatch . IEEE Transactions on Power Systems , 4 ( 23 ) : 1627 – 1636 .
   Web of Science ®Google Scholar
• Woo , D. S. and Yim , H. S. 1998 . A heuristic algorithm for mean flowtime objective in flowshop scheduling . Computers and Operations Research , 25 ( 3 ) : 175 – 182 .
   Web of Science ®Google Scholar
• Zhang , Y. , Li , X. and Wang , Q. 2009 . Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization . European Journal of Operational Research , 196 ( 3 ) : 869 – 876 .
   Web of Science ®Google Scholar