Batch scheduling on parallel machines with dynamic job arrivals and incompatible job families

References

• Agarwal, R. et al., in press. “Solving parallel machine scheduling problems with variable depth local search”. Journal of Scheduling.
   Google Scholar
• Azizoglu , M. and Webster , S. 2001 . Scheduling a batch processing machine with incompatible job families . Computers and Industrial Engineering , 39 : 325 – 335 .
   Web of Science ®Google Scholar
• Balasubramanian , H. 2004 . Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness . International Journal of Production Research , 42 : 1621 – 1638 .
   Web of Science ®Google Scholar
• Cheng , T. C. E. and Kovalyov , M. Y. 2001 . Single machine batch scheduling with sequential job processing . IIE Transactions , 33 : 413 – 429 .
   Web of Science ®Google Scholar
• Dobson , G. and Nambimadom , R. S. 2001 . The batch loading and scheduling problem . Operations Research , 49 : 52 – 65 .
   Web of Science ®Google Scholar
• Erramilli , V. and Mason , S. J. 2008 . Multiple orders per job batch scheduling with incompatible job families . Annals of Operations Research , 159 : 245 – 260 .
   Web of Science ®Google Scholar
• Fowler , J. W. , Phillips , D. T. and Hogg , G. L. 1992 . Real-time control of multiproduct bulk-service semiconductor manufacturing processes . IEEE Transactions on Semiconductor Manufacturing , 5 : 158 – 163 .
   Web of Science ®Google Scholar
• Hall , N. G. and Posner , M. E. 2007 . Performance prediction and preselection for optimization and heuristic solution procedures . Operations Research , 55 : 703 – 716 .
   Web of Science ®Google Scholar
• Hansen , P. and Mladenovic , N. 2001 . Variable neighborhood search: principles and applications . European Journal of Operational Research , 130 : 449 – 467 .
   Web of Science ®Google Scholar
• Keha , A. B. , Khowala , K. and Fowler , J. W. 2009 . Mixed integer programming formulations for single machine scheduling problems . Computers and Industrial Engineering , 56 : 357 – 367 .
   Web of Science ®Google Scholar
• Koh , S. G. 2005 . Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families . International Journal of Production Economics , 98 : 81 – 96 .
   Web of Science ®Google Scholar
• Kurz , M. E. and Mason , S. J. 2008 . Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times . International Journal of Production Research , 46 : 131 – 151 .
   Web of Science ®Google Scholar
• Lee , C. Y. and Uzsoy , R. 1999 . Minimizing makespan on a single batch processing machine with dynamic job arrivals . International Journal of Production Research , 37 : 219 – 236 .
   Web of Science ®Google Scholar
• Malve , S. and Uzsoy , R. 2007 . A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families . Computers and Operations Research , 34 : 3016 – 3024 .
   Web of Science ®Google Scholar
• Mladenovic , N. and Hansen , P. 1997 . Variable neighborhood search . Computers and Operations Research , 24 : 1097 – 1100 .
   Web of Science ®Google Scholar
• Mönch , L. 2005 . Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times . Computers and Operations Research , 32 : 2731 – 2750 .
   Web of Science ®Google Scholar
• Naderi , B. 2008 . A variable neighborhood search for hybrid flexible flowshops with setup times minimizing total completion time . Journal of Applied Sciences , 8 : 2843 – 2850 .
   Google Scholar
• Perez , I. C. , Fowler , J. W. and Carlyle , W. M. 2005 . Minimizing total weighted tardiness on a single batch process machine with incompatible job families . Computers and Operations Research , 32 : 327 – 341 .
   Web of Science ®Google Scholar
• Pinedo , M. 2012 . Scheduling, Theory, Algorithms, and Systems , 4th ed. , New York : Springer .
   Google Scholar
• Potts , C. N. and Kovalyov , M. Y. 2000 . Scheduling with batching: a review . European Journal of Operational Research , 120 : 228 – 249 .
   Web of Science ®Google Scholar
• Sung , C. S. 2002 . Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals . Computers and Operations Research , 29 : 995 – 1007 .
   Web of Science ®Google Scholar
• Unlu , Y. and Mason , S. J. 2010 . Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems . Computers and Industrial Engineering , 58 : 785 – 800 .
   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 : 1615 – 1635 .
   Web of Science ®Google Scholar
• Uzsoy , R. 1995 . Scheduling batch processing machines with incompatible job families . International Journal of Production Research , 33 : 2685 – 2708 .
   Web of Science ®Google Scholar