A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardiness

References

• Baker , KR and Scudder , GD . 1990 . Sequencing with earliness and tardiness penalties: a review . Operations Research , 38 ( 1 ) : 22 – 36 .
   Web of Science ®Google Scholar
• Chandra , C , Mehta , P and Tirupati , D . 2009 . Permutation flow shop scheduling with earliness and tardiness penalties . International Journal of Production Research , 47 ( 20 ) : 5591 – 5610 .
   Web of Science ®Google Scholar
• Framinan , JM and Leisten , R . 2008 . Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm . International Journal of Production Research , 46 ( 22 ) : 6479 – 6498 .
   Web of Science ®Google Scholar
• Hasija , S and Rajendran , C . 2004 . Scheduling in flowshops to minimize total tardiness of jobs . International Journal of Production Research , 42 ( 11 ) : 2289 – 2301 .
   Web of Science ®Google Scholar
• Holthaus , O and Rajendran , C . 2005 . A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs . Journal of the Operational Research Society , 56 ( 8 ) : 947 – 953 .
   Web of Science ®Google Scholar
• Hoogeveen , H . 2005 . Multicriteria scheduling . European Journal of Operational Research , 167 ( 3 ) : 592 – 623 .
   Web of Science ®Google Scholar
• Kanet , JJ and Sridharan , V . 2000 . Scheduling with inserted idle time: problem taxonomy and literature review . Operations Research , 48 ( 1 ) : 99 – 110 .
   Web of Science ®Google Scholar
• Kim , Y . 1993 . Heuristics for flowshop scheduling problems minimizing mean tardiness . Journal of Operational Research Society , 44 ( 1 ) : 19 – 28 .
   Web of Science ®Google Scholar
• Kim , Y , Lim , HG and Park , MW . 1996 . Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process . European Journal of Operational Research , 91 ( 1 ) : 124 – 143 .
   Web of Science ®Google Scholar
• Korman , K . 1994. A pressing matter. Video, 17 (2), February, 46–50
   Google Scholar
• Landis , K . 1993. Group technology and cellular manufacturing in the Westvaco Los Angeles VH Department, Project report in IOM 581, School of Business, University of Southern California
   Google Scholar
• Madhushini , N , Rajendran , C and Deepa , Y . 2009 . Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs . Journal of the Operational Research Society , 60 ( 7 ) : 991 – 1004 .
   Web of Science ®Google Scholar
• Moslehi , G . 2009 . Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness . International Journal of Production Economics , 122 ( 2 ) : 763 – 773 .
   Web of Science ®Google Scholar
• Parthasarathy , S and Rajendran , C . 1997 . A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs – A case study . Production Planning and Control , 8 ( 5 ) : 475 – 483 .
   Web of Science ®Google Scholar
• Rajendran , C . 1999 . Formulations and heuristics for scheduling in a kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers . International Journal of Production Research , 37 ( 5 ) : 1137 – 1158 .
   Web of Science ®Google Scholar
• Singh , A . 2010 . A hybrid permutation-coded evolutionary algorithm for the early/tardy scheduling problem . Asia-Pacific Journal of Operational Research , 27 ( 6 ) : 713 – 725 .
   Web of Science ®Google Scholar
• Taillard , E . 1993 . Benchmarks for basic scheduling problems . European Journal of Operational Research , 64 ( 2 ) : 278 – 285 .
   Web of Science ®Google Scholar
• Valente , JMS . 2009 . Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs . Asia-Pacific Journal of Operational Research , 26 ( 3 ) : 319 – 339 .
   Web of Science ®Google Scholar
• Vallada , E and Ruiz , R . 2010 . Genetic algorithms with path relinking for the minimium tardiness permutation flowshop problem . Omega , 38 ( 1–2 ) : 57 – 67 .
   Web of Science ®Google Scholar
• Vallada , E , Ruiz , R and Minella , G . 2008 . Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics . Computers & Operations Research , 4 ( 4 ) : 1350 – 1373 .
   Web of Science ®Google Scholar
• Zegordi , SH , Itoh , K and Enkawa , T . 1995 . A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem . International Journal of Production Research , 33 ( 5 ) : 1449 – 1466 .
   Web of Science ®Google Scholar