Batch scheduling problem for a machinery factory with fixed-position layout

References

• Agnetis , A , Rossi , F and Gristina , G . 1998 . An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer . Naval Research Logistics , 45 : 141 – 164 .
   Web of Science ®Google Scholar
• Ahmadi , JH . 1992 . Batching and scheduling jobs on batch and discrete processors . Operations Research , 39 : 750 – 763 .
   Web of Science ®Google Scholar
• Allahverdi , A , Gupta , JND and Aldowaisan , T . 1999 . A review of scheduling research involving setup considerations . Omega , 27 : 219 – 239 .
   Web of Science ®Google Scholar
• Allahverdi , A . 2008 . A survey of scheduling problems with setup times or costs . European Journal of Operational Research , 187 : 985 – 1032 .
   Web of Science ®Google Scholar
• Baker , KR . 1990 . Scheduling groups of jobs in the two-machine flow shop . Mathematical and Computer Modelling , 13 : 29 – 36 .
   Web of Science ®Google Scholar
• Baker , KR and Magazine , MJ . 2000 . Minimising maximum lateness with job families . European Journal of Operational Research , 127 : 126 – 139 .
   Web of Science ®Google Scholar
• Brucker , P . 1998 . Scheduling a batching machine . Journal of Scheduling , 1 : 31 – 54 .
   Google Scholar
• Bukchin , J , Tzur , M and Jaffe , M . 2002 . Lot splitting to minimise average flow-time in a two-machine flow-shop . IIE Transactions , 34 : 953 – 970 .
   Web of Science ®Google Scholar
• Chan , FTS , Wong , TC and Chan , LY . 2009 . The application of genetic algorithms to lot streaming in a job-shop scheduling problem . International Journal of Production Research , 47 : 3387 – 3412 .
   Web of Science ®Google Scholar
• Chandru , V , Lee , CY and Uzsoy , R . 1993 . Minimising total completion time on a batch processing machine with job families . Operations Research Letters , 13 : 61 – 65 .
   Web of Science ®Google Scholar
• Chen , JS , Pan , JCH and Lin , CM . 2008 . A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem . Expert Systems with Applications , 34 : 570 – 577 .
   Web of Science ®Google Scholar
• Chen , B , Potts , CN and Strusevich , VA . 1998 . Approximation algorithms for two-machine flow shop scheduling with batch setup times . Mathematical Programming , 82 : 255 – 271 .
   Web of Science ®Google Scholar
• Damodaran , P and Srihari , K . 2004 . Mixed integer formulation to minimise makespan in a flow shop with batch processing machines . Mathematical and Computer Modeling , 40 : 1465 – 1472 .
   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
• Gokhale , R and Mathirajan , M . 2011 . Heuristic algorithms for scheduling of a batch processor in automobile gear manufacturing . International Journal of Production Research , 49 : 2705 – 2728 .
   Web of Science ®Google Scholar
• Gong , H , Tang , L and Duin , CW . 2010 . A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times . Computers & Operations Research , 37 : 960 – 969 .
   Web of Science ®Google Scholar
• Hillier , FS and Lieberman , GJ . 2001 . Introduction to Operations Research , 7th , 576 – 590 . New York : McGraw-Hill .
   Google Scholar
• Hochbaum , DS and Landy , D . 1997 . Scheduling semiconductor burn-in operations to minimise total flow-time . Operations Research , 45 : 874 – 885 .
   Web of Science ®Google Scholar
• Hoogeveen , JA and Kawaguchi , T . 1999 . Minimising total completion time in a two-machine flowshop: analysis of special cases . Mathematics of Operations Research , 24 : 887 – 913 .
   Web of Science ®Google Scholar
• Hoogeveen , JA and van de Velde , SL . 1998 . Scheduling by positional completion times: analysis of a two-stage with a batching machine . Mathematical Programming , 82 : 273 – 289 .
   Web of Science ®Google Scholar
• ILOG, 2003. ILOG OPL Studio 3.7 Language manual. France
   Google Scholar
• Kim , B and Kim , S . 2002 . Application of genetic algorithms for scheduling batch-discrete production system . Production Planning & Control , 13 : 155 – 165 .
   Web of Science ®Google Scholar
• Laha , D and Sarin , SC . 2009 . A heuristic to minimise total flow-time in permutation flow shop . Omega , 37 : 734 – 739 .
   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 : 764 – 775 .
   Web of Science ®Google Scholar
• Lin , BMT and Jeng , AAK . 2004 . Parallel-machine batch scheduling to minimise the maximum lateness and the number tardy jobs . International Journal of Production Economics , 91 : 121 – 134 .
   Web of Science ®Google Scholar
• Lin , R and Liao , CJ . 2010. A case study of batch scheduling for an assembly shop. Working paper, National Taiwan University of Science and Technology
   Google Scholar
• Luo , H . 2011 . Hybrid flowshop scheduling with batch-discrete processors and machine maintenance in time windows . International Journal of Production Research , 49 : 1575 – 1603 .
   Web of Science ®Google Scholar
• Mehta , SV and Uzsoy , R . 1998 . Minimising total tardiness on a batch processing machine with incompatible job families . IIE Transactions , 30 : 165 – 178 .
   Web of Science ®Google Scholar
• Mokhtari , H , Abadi , INK and Cheraghalikhani , A . 2011 . A multi-objective flow shop scheduling with resource-dependent processing times: trade-off between makespan and cost of resources . International Journal of Production Research , 49 ( 19 ) : 5851 – 5875 .
   Web of Science ®Google Scholar
• Perez , IC , Fowler , JW and Carlyle , WM . 2005 . Minimising total weighted tardiness on a single batch process machine with incompatible job families . Computers & Operations Research , 32 : 327 – 341 .
   Web of Science ®Google Scholar
• Potts , CN and Van Wassenhove , LN . 1991 . Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity . Journal of the Operational Research Society , 46 : 395 – 406 .
   Google Scholar
• Potts , CN and Kovalyov , MY . 2000 . Scheduling with batching: a review . European Journal of Operational Research , 120 : 228 – 249 .
   Web of Science ®Google Scholar
• Pranzo , M . 2004 . Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times . European Journal of Operational Research , 153 : 581 – 592 .
   Web of Science ®Google Scholar
• Qin , W and Huang , GQ . 2009 . A two-level genetic algorithm for scheduling in assembly islands with fixed-position layouts. In: Proceedings of the 16th ISPE international conference on concurrent engineering. Part 1, 17–28 . London: Springer . 2009 .
   Google Scholar
• Quadt , D and Kuhn , H . 2007 . Batch scheduling of jobs with identical process times on flexible flow lines . International Journal Production Economics , 105 : 385 – 401 .
   Web of Science ®Google Scholar
• Su , LH . 2003 . A hybrid two-stage flow shop with limited waiting time constraints . Computers & Industrial Engineering , 44 : 409 – 424 .
   Web of Science ®Google Scholar
• Su , LH , Yang , DL and Chou , HK . 2009 . A two-stage flowshop scheduling with limited buffer . Asia-Pacific Journal of Operational Research , 26 : 503 – 522 .
   Web of Science ®Google Scholar
• Webster , ST and Baker , KR . 1995 . Scheduling groups of jobs on a single machine . Operations Research , 43 : 692 – 703 .
   Web of Science ®Google Scholar