A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families

References

• Azizoglu , M and Webster , S . 2000 . Scheduling a batch processing machine with non-identical job sises . Int. J. Prod. Res. , 38 : 2173 – 2184 .
   Web of Science ®Google Scholar
• Azizoglu , M and Webster , S . 2001 . Scheduling a batch processing machine with incompatible job families . Comp. Indust. Eng. , 39 : 325 – 335 .
   Web of Science ®Google Scholar
• Balasubramanian , H , Monch , L , Fowler , J and Pfund , M . 2004 . Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimise total weighted tardiness . Int. J. Prod. Res. , 42 : 1621 – 1638 .
   Web of Science ®Google Scholar
• Brucker , P , Gladky , A , Hoogeveen , H , Kovalyov , MY , Potts , CN , Tautenhahn , T and van de Velde , SL . 1998 . Scheduling a batching machine . J. Sched. , 1 : 31 – 54 .
   Google Scholar
• Brucker , P and Knust , K . Complexity results for scheduling problems Available online at: http://www.mathematik.uni-osnabrueck.de/research/OR/class(accessed 20 February 2006)
   Google Scholar
• Chandru , V , Lee , CY and Uzsoy , R . 1993 . Minimising total completion time on batch processing machine . Int. J. Prod. Res. , 31 : 2097 – 2121 .
   Web of Science ®Google Scholar
• Cheraghi , SH , Vishwaram , V and Krishnan , KK . 2003 . Scheduling a single batch-processing machine with disagreeable ready times and due dates . Int. J. Indust. Eng. , 10 : 175 – 187 .
   Web of Science ®Google Scholar
• Du , J and Leung , JY-T . 1990 . Minimising total tardiness on one processor is NP-hard . Math. Oper. Res. , 3 : 483 – 495 .
   Web of Science ®Google Scholar
• Dupont , L and Dhaenens-Flipo , C . 2002 . Minimising the makespan on a batch machine with non-identical job sizes: an exact procedure . Comp. Oper. Res. , 29 : 807 – 819 .
   Web of Science ®Google Scholar
• Dupont , L and Ghazvini , FJ . 1997 . A branch and bound algorithm for minimising mean flow time on a single batch processing machine . Int. J. Indust. Eng. , 4 : 197 – 203 .
   Web of Science ®Google Scholar
• Graham , RL , Lawler , EL , Lenstra , JK and Rinnooy Kan , AHG . 1979 . Optimisation and approximation in deterministic sequencing and scheduling theory: a survey . Ann. Disc. Math. , 5 : 287 – 326 .
   Google Scholar
• Hochbaum , DS and Landy , D . 1997 . Scheduling semiconductor burn-in operations to minimise total flowtime . Oper. Res. , 45 : 874 – 885 .
   Web of Science ®Google Scholar
• Kurz , ME and Mason , SJ . 2005 . Minimising total weighted tardiness on a batch-processing machine with incompatible job families and job ready times . Int. J. Prod. Res. , : in press (submitted in July 2005)
   Google Scholar
• Kurz , ME . 2003 . On the structure of optimal schedules for minimising total weighted tardiness on parallel, batch-processing machines . Proceedings of the Industrial Engineering Research Conference . 2003 , Portland , OR . (CD-ROM)
   Google Scholar
• Li , C-L and Lee , C-Y . 1997 . Scheduling with agreeable release times and due dates on a batch processing machine . Euro. J. Op. Res. , 96 : 564 – 569 .
   Web of Science ®Google Scholar
• Mathirajan , M and Sivakumar , AI . 2003 . Scheduling of batch processors in semiconductor manufacturing. A review . Proceedings of the Singapore MIT Alliance . 2003 . Available online at: http://dspace.mit.edu/retrieve/3521/IMST021 (accessed 20 February 2006)
   Google Scholar
• Mehta , SV and Uzsoy , R . 1998 . Minimising total tardiness on a batch-processing machine with incompatible job families . IIE Trans. , 30 : 165 – 178 .
   Web of Science ®Google Scholar
• Monch , L , Balasubramanian , H , Fowler , JW and Pfund , ME . 2005 . Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times . Comp. Oper. Res. , 32 : 2731 – 2750 .
   Web of Science ®Google Scholar
• Perez , I , Fowler , JW and Carlyle , WM . 2005 . Minimising total weighted tardiness on a single batch processing machine with incompatible job families . Comp. Oper. Res. , 32 : 327 – 341 .
   Web of Science ®Google Scholar
• Potts , CN and Kovalyov , MY . 2000 . Scheduling with batching: a review . Euro. J. Op. Res. , 120 : 228 – 249 .
   Web of Science ®Google Scholar
• Qi , X and Tu , F . 1999 . Earliness and tardiness scheduling problems on a batch processor . Disc. Appl. Math. , 98 : 131 – 145 .
   Web of Science ®Google Scholar
• Rinnooy Kan , AHG . 1976 . Machine Scheduling Problems , The Hague , , The Netherlands : Martinus Nijhoff .
   Google Scholar
• Sung , CS and Choung , YI . 2000 . Minimising makespan on a single burn-in oven in semiconductor manufacturing . Euro. J. Oper. Res. , 120 : 550 – 574 .
   Web of Science ®Google Scholar
• Sung , CS , Choung , YI , Hong , JM and Kim , YH . 2002 . Minimising makespan on a single burn-in oven with job families and dynamic job arrivals . Comp. Oper. Res. , 29 : 995 – 1007 .
   Web of Science ®Google Scholar
• Uzsoy , R and Yang , Y . 1997 . Minimising total weighted completion time on a single batch processing machine . Prod. Op. Manage. , 6 : 57 – 73 .
   Google Scholar
• Uzsoy , R . 1994 . Scheduling a single batch processing machines with non identical job sizes . Int. J. Prod. Res. , 32 : 1615 – 1635 .
   Web of Science ®Google Scholar
• Uzsoy , R . 1995 . Scheduling batch processing machines with incompatible job families . Int. J. Prod. Res. , 33 : 2685 – 2708 .
   Web of Science ®Google Scholar
• Wang , CS and Uzsoy , R . 2002 . A genetic algorithm to minimise maximum lateness on a batch processing machine . Comp. Oper. Res. , 29 : 1621 – 1640 .
   Web of Science ®Google Scholar
• Webster , S and Baker , KR . 1995 . Scheduling groups of jobs on a single machine . Oper. Res. , 43 : 692 – 703 .
   Web of Science ®Google Scholar