Batch-size-based rearrangement of the shop floor into mini-lines

References

• Adler , L . 1993 . BPSS: A scheduling support system for the packaging industry . Operations Research , 41 ( 4 ) : 641 – 648 .
   Web of Science ®Google Scholar
• Ahmadi , RH and Matsuo , H . 1991 . The line segmentation problem . Operations Research , 39 ( 1 ) : 42 – 55 .
   Web of Science ®Google Scholar
• Ahmadi , JH . 1992 . Batching and scheduling jobs on batch and discrete processors . Operations Research , 40 ( 4 ) : 750 – 763 .
   Web of Science ®Google Scholar
• Conway , R , Maxwell , W and Miller , L . 1967 . Theory of scheduling , Reading, MA : Addison-Wesley .
   Google Scholar
• Dietrich , B and Escudero , L . 1993 . On modelling the maximum workload allocation for parallel unrelated machines with setups . Annals of Operations Research , 43 ( 7 ) : 359 – 377 .
   Google Scholar
• França , PM . 2005 . Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups . Computers & Industrial Engineering , 48 ( 3 ) : 491 – 506 .
   Web of Science ®Google Scholar
• Garey , MR and Johnson , DS . 2002 . Computers and intractability: A guide to the theory of NP-completeness , New York : W. H. Freeman and Company .
   Google Scholar
• Graham , RL , Knuth , DE and Patashnik , O . 1994 . Concrete mathematics: A foundation for computer science, , 2nd , Reading, MA : Addison-Wesley .
   Google Scholar
• Guinet , A . 1993 . Scheduling sequencing-dependent jobs on identical parallel machines to minimize completion criteria . International Journal of Production Research , 31 ( 7 ) : 1579 – 1594 .
   Web of Science ®Google Scholar
• Guinet , AGP and Solomon , MM . 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
• Laub , JD , Fowler , JW and Keha , AB . 2007 . Minimizing makespan with multiple-orders-per-job in a two-machine flowshop . European Journal of Operations Research , 182 ( 1 ) : 63 – 79 .
   Web of Science ®Google Scholar
• Lee , CY , Uzsoy , R and Martin-Vega , LA . 1992 . Efficient algorithms for scheduling semiconductor burn-in operations . Operations Research , 40 ( 4 ) : 764 – 775 .
   Web of Science ®Google Scholar
• Michalewicz , Z . 1999 . Genetic algorithms + data structures = evolution programs, , 3rd , New York : Springer .
   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
• Potts , CN and Kovalyov , M . 2000 . Scheduling with batching: A review . European Journal of Operations Research , 120 ( 2 ) : 228 – 249 .
   Web of Science ®Google Scholar
• Quadt , D and Kuhn , H . 2005 . 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
• Quadt , D and Kuhn , H . 2007a . Batch scheduling of jobs with identical process times on flexible flow lines . International Journal of Production Economics , 105 ( 2 ) : 385 – 401 .
   Web of Science ®Google Scholar
• Quadt , D and Kuhn , H . 2007b . A taxonomy of flexible flow line scheduling procedures . European Journal of Operations Research , 178 ( 3 ) : 686 – 698 .
   Web of Science ®Google Scholar
• Salvador , MS . 1973 . “ A solution to a special class of flow shop scheduling problems ” . In In: Symposium on the theory of scheduling and its applications , 83 – 91 . New York : Springer .
   Google Scholar
• Shapiro , R(Donner Company) . 1998 . Harvard Business School case , Cambridge, MA : Harvard Business Publishing, Harvard University .
   Google Scholar
• Tang , C . 1990 . Scheduling batches on parallel machines with major and minor setups . European Journal of Operations Research , 46 ( 1 ) : 28 – 37 .
   Web of Science ®Google Scholar
• Uzsoy , R . 1994 . Scheduling a single batch processing machine with non-identical job sizes . International Journal of Production Research , 32 ( 7 ) : 1615 – 1635 .
   Web of Science ®Google Scholar
• Wang , X and Cheng , TCE . 2005 . Two-machine flowshop scheduling with job class setups to minimize total flowtime . Computers & Operations Research , 32 ( 11 ) : 2751 – 2770 .
   Web of Science ®Google Scholar
• Wang , X and Cheng , TCE . 2007 . An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint . Computers & Operations Research , 34 ( 10 ) : 2894 – 2901 .
   Google Scholar
• Wittrock , RJ . 1988 . An adaptable scheduling algorithm for flexible flow lines . Operations Research , 36 ( 3 ) : 445 – 453 .
   Web of Science ®Google Scholar