Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems

References

• Chang , YL , Toshiyuki , S and Robert , SS . 1996 . Ranking dispatching rules by data envelopment analysis in a job shop environment . IIE Transactions , 28 : 631 – 642 .
   Web of Science ®Google Scholar
• Chen , CL , Vempati , VS and Aljaber , N . 1995 . An application of genetic algorithms for flow shop problems . European Journal of Operational Research , 80 : 389 – 396 .
   Web of Science ®Google Scholar
• Demirkol , E , Mehta , S and Uzsoy , R . 1998 . Benchmarks for shop scheduling problems . European Journal of Operational Research , 109 : 137 – 141 .
   Web of Science ®Google Scholar
• Dudek , RA , Panwalkar , SS and Smith , ML . 1992 . The lessons of flowshop scheduling research . Operational Research , 40 : 7 – 13 .
   Web of Science ®Google Scholar
• Garey , MR , Johnson , DS and Sethi , R . 1976 . The complexity of flowshop and jobshop scheduling . Mathematics of Operations Research , 1 : 117 – 129 .
   Google Scholar
• Glover , F . 1989 . Tabu search-Part I . ORSA Journal of Computing , 1 : 190 – 206 .
   Google Scholar
• Glover , F . 1990 . Tabu search-Part II . ORSA Journal of Computing , 2 : 4 – 32 .
   Google Scholar
• Grabowski , J and Wodecki , M . 2004 . A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion . Computers and Operations Research , 31 : 281 – 284 .
   Web of Science ®Google Scholar
• Graham , RL , Lawler , EL , Lenstra , JK and Rinnooy Kan , AHG . 1979 . Optimisation and approximation in deterministic sequencing and scheduling: a survey . Annals of Discrete Mathematics , 5 : 287 – 362 .
   Google Scholar
• Haupt , R . 1989 . A survey of priority rule-based scheduling . OR Spektrum , 11 : 3 – 16 .
   Google Scholar
• Holthaus , O and Rajendran , C . 2000 . Efficient jobshop dispatching rules: further developments . Production Planning & Control , 11 : 171 – 178 .
   Web of Science ®Google Scholar
• James , ED and Michael , PH . 1970 . Review of sequencing research . Naval Research Logistics Quarterly , 17 : 11 – 39 .
   Google Scholar
• King , JR and Spachis , AS . 1980 . Heuristics for flow-shop scheduling . International Journal of Production Research , 18 : 345 – 357 .
   Web of Science ®Google Scholar
• Kirkpatrik , S , Gelatt , CD and Vecch , MP . 1983 . Optimisation by simulated annealing . Science , 220 : 671 – 680 .
   PubMed Web of Science ®Google Scholar
• Koulamas , C . 1998 . A new constructive heuristic for the flowshop scheduling problem . European Journal of Operational Research , 105 : 66 – 71 .
   Web of Science ®Google Scholar
• Liao , C-J , Liao , L-M and Tseng , C-T . 2006 . A performance evaluation of permutation vs. non-permutation schedules in a flowshop . International Journal of Production Research , 44 : 4297 – 4309 .
   Web of Science ®Google Scholar
• Metropolis , N , Rosenbluth , AW , Rosenbluth , MN , Teller , AH and Teller , E . 1953 . Equations of state calculations by fast computing machines . Journal of Chemical Physics , 21 : 1087 – 1092 .
   Web of Science ®Google Scholar
• Ogbu , FA and Smith , DK . 1990 . The application of the simulated annealing algorithm to the solution of the n/m/C max flowshop problem . Computers and Operations Research , 17 : 243 – 253 .
   Web of Science ®Google Scholar
• Park , YB , Pegden , CD and Enscore , EE . 1984 . A survey and evaluation of static flowshop scheduling heuristics . International Journal of Production Research , 22 : 127 – 141 .
   Web of Science ®Google Scholar
• Pinedo , M . 2002 . Scheduling: theory, algorithms and system , 2nd , Englewood Cliffs, NJ : Prentice-Hall .
   Google Scholar
• Potts , CN and Van Wassenhove , LN . 1991 . Single machine tardiness sequencing heuristics . IIE Transactions , 23 : 346 – 354 .
   Web of Science ®Google Scholar
• Reisman , A , Kumar , A and Motwani , J . 1997 . Flowshop scheduling/sequencing research: a statistical review of the literature, 1952–1994 . IEEE Transactions on Engineering Management , 44 : 316 – 329 .
   Web of Science ®Google Scholar
• Tandon , M , Cummings , PT and Levan , MD . 1991 . Flowshop sequencing with non-permutation schedules . Computers and Chemical Engineering , 15 : 601 – 607 .
   Web of Science ®Google Scholar
• Tiwari , MK , Kumar , S , Kumar , S , Prakash and Shankar , R . 2006 . Solving part-type and operation allocation problems in an FMS: an approach using constraints-based fast simulated annealing algorithm . IEEE Transaction on System, Man and Cybernetics. Part A: Systems and Human , 36 : 1170 – 1184 .
   Web of Science ®Google Scholar
• Turner , S and Booth , D . 1987 . Comparison of heuristics for flow shop sequencing . Omega , 15 : 75 – 85 .
   Web of Science ®Google Scholar
• Widmer , M and Hertz , A . 1989 . A new heuristic method for the flow shop sequencing problem . European Journal of Operational Research , 41 : 186 – 193 .
   Web of Science ®Google Scholar
• Ying , K-C and Liao , C-J . 2004 . An ant colony system for permutation flow-shop sequencing . Computers and Operations Research , 31 : 791 – 801 .
   Web of Science ®Google Scholar
• Ying , K-C and Lin , S-W . 2007 . Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems . International Journal of Advanced Manufacturing Technology , 33 : 793 – 802 .
   Web of Science ®Google Scholar