Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times

References

• Aarts , E and Lenstra , JK . 1997 . Search in combinatorial optimization , New York : John Wiley & Sons .
   Google Scholar
• Adenso-Diaz , B . 1996 . An SA/TS mixture algorithm for the scheduling tardiness problem . European Journal of Operational Research , 88 ( 3 ) : 516 – 524 .
   Google Scholar
• Adler , L . 1993 . BPSS: a scheduling support system for the packaging industry . Operations Research , 41 ( 4 ) : 641 – 648 .
   Web of Science ®Google Scholar
• Agnetis , A . 1997 . Scheduling of flexible flow lines in an automobile assembly plant . European Journal of Operational Research , 97 ( 2 ) : 348 – 362 .
   Web of Science ®Google Scholar
• Ahmed , MU and Sundararaghavan , PS . 1990 . Minimizing the weighted sum of late and early completion penalties in a single machine . IIE Transactions , 22 ( 3 ) : 288 – 290 .
   Web of Science ®Google Scholar
• Ahuja , RK . 2002 . A survey of very large-scale neighborhood search techniques . Discrete Applied Mathematics , 123 ( 1–3 ) : 75 – 102 .
   Web of Science ®Google Scholar
• Allahverdi , A . 2008 . A survey of scheduling problems with setup times or costs . European Journal of Operational Research , 187 ( 3 ) : 985 – 1032 .
   Web of Science ®Google Scholar
• Allaoui , H and Artiba , A . 2004 . Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints . Computers and Industrial Engineering , 47 ( 4 ) : 431 – 450 .
   Web of Science ®Google Scholar
• Anghinolfi , D and Paolucci , M . 2007 . Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach . Computers & Operations Research , 34 ( 11 ) : 3471 – 3490 .
   Web of Science ®Google Scholar
• Arthanary , TS and Ramaswamy , KG . 1971 . An extension of two machine sequencing problems . Opsearch , 8 ( 1 ) : 10 – 22 .
   Google Scholar
• Baker , KR . 1974 . Introduction to sequence and scheduling , New York : John Wiley .
   Google Scholar
• Baker , KR and Scudder , DG . 1989 . Sequencing with earliness and tardiness penalties: a review . Operations Research , 38 ( 1 ) : 22 – 36 .
   Google Scholar
• Bean , JC . 1994 . Genetic algorithms and random keys for sequencing and optimization . ORSA Journal on Computing , 6 ( 2 ) : 154 – 160 .
   Google Scholar
• Brah , SA . 1996 . A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors . Production Planning and Control , 7 ( 4 ) : 362 – 373 .
   Web of Science ®Google Scholar
• Chang , P-C , Chen , S-H and Fan , C-Y . 2008 . A hybrid electromagnetism-like algorithm for single machine scheduling problem . Expert Systems with Applications , doi:10.1016/j.eswa.2007.11.050. [In press]
   Google Scholar
• Conway , RW and Maxwell , WL . 1967 . Theory of scheduling , Reading, MA : Addison-Wesley .
   Google Scholar
• Dorigo , M and Stützle , T . 2004 . Ant colony optimization , Boston, MA : MIT Press .
   Google Scholar
• Elmaghraby , SE and Kamoub , RE . 1997 . “ Production control in hybrid flowshops: an example from textile manufacturing ” . In The planning and scheduling of production systems , Edited by: Artiba , A and Elmaghraby , SE . 163 – 198 . London, , UK : Chapman and Hall .
   Google Scholar
• Fleszar , K and Hindi , KS . 2002 . New heuristics for one-dimensional bin-packing . Computers & Operations Research , 29 ( 7 ) : 821 – 839 .
   Web of Science ®Google Scholar
• Gajpal , Y and Rajendran , C . 2006 . An ant colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops . International Journal of Production Economics , 101 ( 2 ) : 259 – 272 .
   Web of Science ®Google Scholar
• Guinet , AGP and Solomon , M . 1996 . Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time . International Journal of Production Research , 34 ( 6 ) : 1643 – 1654 .
   Web of Science ®Google Scholar
• Gupta , JND and Tunç , EA . 1994 . Scheduling a two-stage hybrid flow shop with separable setup and removal times . European Journal of Operational Research , 77 ( 3 ) : 415 – 428 .
   Web of Science ®Google Scholar
• Janiak , A . 2007 . Metaheuristic approaches to the hybrid flowshop scheduling problem with a cost-related criterion . International Journal of Production Economics , 105 ( 2 ) : 407 – 424 .
   Web of Science ®Google Scholar
• Jungwattanaki , J . 2005 . An evaluation of sequencing heuristics for flexible flowshop scheduling problems with unrelated parallel machines and dual criteria. Preprint series: 05–28 (MSC: 90B35) , 1 – 23 . Germany : Otto-von-Guericke-Universitat Magdeburg .
   Google Scholar
• Kirkpatrick , S , Gelatt , CD and Vecchi , MP . 1983 . Optimization by simulated annealing . Science , 220 ( 4598 ) : 671 – 680 .
   PubMed Web of Science ®Google Scholar
• Kurz , ME and Askin , RG . 2003 . Comparing scheduling rules for flexible flow lines . International Journal of Production Economics , 85 ( 3 ) : 371 – 388 .
   Web of Science ®Google Scholar
• Kurz , ME and Askin , RG . 2004 . Scheduling flexible flow lines with sequence-dependent setup times . European Journal of Operational Research , 159 ( 1 ) : 66 – 82 .
   Web of Science ®Google Scholar
• Lauff , V and Werner , F . 2004 . Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey . Mathematical and Computer Modelling , 40 ( 5–6 ) : 637 – 656 .
   Web of Science ®Google Scholar
• Lee , GC , Kim , YD and Choi , SW . 2004 . Bottleneck-focused scheduling for a hybrid flowshop . International Journal of Production Research , 42 ( 1 ) : 165 – 181 .
   Web of Science ®Google Scholar
• Leon , VJ and Ramamoorthy , B . 1997 . An adaptable problem-space based search method for flexible flow line scheduling . IIE Transactions , 29 ( 22 ) : 115 – 126 .
   Google Scholar
• Luh , PB . 1998 . Job shop scheduling with group-dependent setups, finite buffers, and long time horizon . Annals of Operation Research , 76 ( 1 ) : 233 – 259 .
   Google Scholar
• M’Hallah , R . 2007 . Minimizing total earliness and tardiness on a single machine using a hybrid heuristic . Computers & Operations Research , 34 ( 10 ) : 3126 – 3142 .
   Web of Science ®Google Scholar
• Mladenovic , N and Hansen , P . 1997 . Variable neighborhood search . Computers and Operations Research , 24 ( 11 ) : 1097 – 1100 .
   Web of Science ®Google Scholar
• Montgomery , DC . 2000 . Design and analysis of experiments , 5 , New York : John Wiley & Sons .
   Google Scholar
• Moursli , O and Pochet , Y . 2000 . A branch-and-bound algorithm for the hybrid flowshop . International Journal of Production Economics , 64 ( 1–3 ) : 113 – 125 .
   Web of Science ®Google Scholar
• Pinedo , M . 1995 . Scheduling theory, algorithms, and systems , 2nd , Englewood Cliffs, NJ : Prentice-Hall .
   Google Scholar
• Portmann , MC . 1998 . Branch and bound crossed with GA to solve hybrid flowshops . European Journal of Operational Research , 107 ( 2 ) : 389 – 400 .
   Web of Science ®Google Scholar
• Pugazhendhi , S . 2004 . Generating non-permutation schedules in flowline based manufacturing systems with sequence-dependent setup times of jobs: a heuristic approach . The International Journal of Advanced Manufacturing Technology , 23 ( 1–2 ) : 64 – 78 .
   Google Scholar
• Quadt , D and Kuhn , H . 2005 . A conceptual framework for lot-sizing and scheduling of flexible flow lines . International Journal of Production Research , 43 ( 11 ) : 2291 – 2308 .
   Web of Science ®Google Scholar
• Riane , F . 1998 . “ Scheduling hybrid flowshops: algorithms and applications ” . In Thesis (PhD) , Wallonia, , Belgium : Faculte´s Universitaires Catholiques de Mons .
   Google Scholar
• Rios-Mercado , RZ and Bard , JF . 1998 . Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups . Computers and Operations Research , 25 ( 5 ) : 351 – 366 .
   Web of Science ®Google Scholar
• Rocha , M . 2007 . Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighborhood search . IMA Journal of Management Mathematics , 18 ( 1 ) : 101 – 116 .
   Google Scholar
• Salvador , MS . 1973 . “ A solution to a special class of flow shop scheduling problems ” . In Symposium on the theory of scheduling and its applications , Edited by: Elmaghraby , SE . 83 – 91 . Berlin : Springer .
   Google Scholar
• Soewnadi , H and Elmaghraby , SE . 2001 . Sequencing three-stage flexible flowshops with identical machines to minimize makespan . IIE Transactions , 33 ( 11 ) : 985 – 993 .
   Google Scholar
• Srikar , BN and Ghosh , S . 1986 . A MILP model for the N-job, M-stage flowshop with sequence dependent set-up times . International Journal of Production Research , 24 ( 6 ) : 1459 – 1474 .
   Web of Science ®Google Scholar
• Stafford , EF and Tseng , FT . 1990 . On the Srikar-Ghosh MILP model for the N*M SDST flowshop problem . International Journal of Production Research , 28 ( 10 ) : 1817 – 1830 .
   Web of Science ®Google Scholar
• Stützle , T . 1998 . An ant approach for the flowshop problem . Proceedings of the sixth European congress on intelligent techniques and soft computing (EUFIT‘98) . 7–10 September 1998 , Aachen, Germany. Edited by: Zimmerman , H . Vol. 3 , pp. 1560 – 1564 .
   Google Scholar
• Su , LH . 2009 . Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system . Computers & Operations Research , 36 ( 2 ) : 461 – 471 . doi:10.1016/j.cor.2007.09.013
   Web of Science ®Google Scholar
• Talbi , E . 2002 . A taxonomy of hybrid metaheuristics . Journal of Heuristics , 8 ( 5 ) : 541 – 564 .
   Web of Science ®Google Scholar
• Tasgetiren , MF . 2007 . Particle swarm optimization algorithm for makespan and total flowtime minimization in permutation flowshop sequencing problem . European Journal of Operational Research , 177 ( 3 ) : 1930 – 1947 .
   Web of Science ®Google Scholar
• Tian , P , Ma , J and Zhang , DM . 1999 . Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: an investigation of generation mechanism . European Journal of Operational Research , 118 ( 1 ) : 81 – 94 .
   Web of Science ®Google Scholar
• Wittrock , R . 1988 . An adaptive scheduling algorithm for flexible flow lines . Operation Research , 36 ( 3 ) : 445 – 453 .
   Web of Science ®Google Scholar
• Yao , X . 1995 . A new simulated annealing algorithm . International Journal of Computer Mathematics , 56 ( 3–4 ) : 161 – 168 .
   Web of Science ®Google Scholar
• Zandieh , M , Fatemi Ghomi , SMT and Moattar Husseini , SM . 2006 . An immune algorithm approach to hybrid flowshops scheduling with sequence-dependent setup times . Applied Mathematics and Computation , 180 ( 1 ) : 111 – 127 .
   Web of Science ®Google Scholar