Scheduling a permutation flow shop with family setups to minimise total tardiness

References

• Behnamian , J , Fatemi Ghomi , SMT and Zandieh , M . 2010 . Development of a hybrid metaheuristic to minimize earliness and tardiness in a hybrid flowshop with sequence-dependent setup times . International Journal of Production Research , 48 ( 5 ) : 1415 – 1438 .
   Web of Science ®Google Scholar
• Chandra , P , 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
• Cheng , TCE , Gupta , JND and Wang , G . 2000 . A review of flowshop scheduling research with setup times . Production and Operations Management , 9 ( 3 ) : 262 – 282 .
   Web of Science ®Google Scholar
• Chung , CS , Flynn , J and Kirca , O . 2006 . A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems . European Journal of Operational Research , 174 ( 1 ) : 1
   Web of Science ®Google Scholar
• Finke , DA , Medeiros , DJ and Traband , MT . 2007 . Multiple machine JIT scheduling: a tabu search approach . International Journal of Production Research , 45 ( 21 ) : 4899 – 4915 .
   Web of Science ®Google Scholar
• Framinan , JM and Leisten , R . 2008 . Total tardiness minimization in permutation flowshops: a simple approach based on a variable greedy algorithm . International Journal of Production Research , 46 ( 22 ) : 6479 – 6498 .
   Web of Science ®Google Scholar
• Gupta , JND and Chantaravarapan , S . 2008 . Single machine group scheduling with family setups to minimize total tardiness . International Journal of Production Research , 46 ( 6 ) : 1707 – 1722 .
   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
• Jorden , C . 1996 . Batching and scheduling: models and methods for several problem classes , Berlin : Springer .
   Google Scholar
• Kim , Y . 1993a . A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops . Computers & Operations Research , 20 ( 4 ) : 391 – 401 .
   Web of Science ®Google Scholar
• Kim , Y . 1993b . Heuristics for flowshop scheduling problems minimizing mean tardiness . Journal of Operational Research Society , 44 ( 1 ) : 19 – 28 .
   Web of Science ®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
• 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
• 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
• Lee , GC and Kim , YD . 2004 . A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness . International Journal of Production Research , 42 ( 22 ) : 4731 – 4743 .
   Web of Science ®Google Scholar
• Liao , CJ , Liao , LM and Tseng , CT . 2006 . A performance evaluation of permutation vs. nun-permutation schedules in a flowshop . International Journal of Production Research , 44 ( 20 ) : 4297 – 4309 .
   Web of Science ®Google Scholar
• Liu , CH . 2010 . A genetic algorithm based approach for scheduling jobs containing multiple orders in a three-machine flowshop . International Journal of Production Research , 48 ( 15 ) : 4379 – 4396 .
   Web of Science ®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
• Pan , JC , Chen , J and Chao , C . 2002 . Minimizing tardiness in a two-machine flow-shop . Computers & Operations Research , 29 ( 7 ) : 869 – 885 .
   Web of Science ®Google Scholar
• Pan , JC and Fan , ET . 1997 . Two-machine flow-shop scheduling to minimize total tardiness . International Journal of Systems Science , 28 ( 4 ) : 405 – 414 .
   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
• Schaller , JE . 2005 . Note on minimizing total tardiness in a two-machine flowshop . Computers & Operations Research , 32 ( 12 ) : 3273 – 3281 .
   Web of Science ®Google Scholar
• Schaller , JE . 2007 . Scheduling on a single machine with family setups to minimize total tardiness . International Journal of Production Economic , 105 ( 2 ) : 329
   Web of Science ®Google Scholar
• Schaller , JE . 2008 . A comparison of procedures to schedule groups of jobs in a flowshop to minimize total tardiness . In: Proceedings of the 2008 Decision Sciences Institute's National Meeting . 2008 , Baltimore , MD .
   Google Scholar
• Sen , T , Dileepan , P and Gupta , JND . 1989 . The two-machine flowshop scheduling problem with total tardiness . Computers & Operations Research , 16 ( 4 ) : 333 – 340 .
   Web of Science ®Google Scholar
• Shingo , S . 1985 . SMED: a revolution in manufacturing , Cambridge , MA : Productivity Press .
   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 , 35 ( 4 ) : 1350
   Web of Science ®Google Scholar
• Vallada , E and Ruiz , R . 2010 . Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem . Omega , 38 ( 1–2 ) : 57 – 67 .
   Web of Science ®Google Scholar