Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times

References

• Baker , KR and Bertrand , JWM . 1982 . A dynamic priority rule for scheduling against due-dates . J. Oper. Manag. , 3 : 37 – 42 .
   Google Scholar
• Brucker , P , Gladky , A , Hoogeveen , H , Kovalyov , MY , Potts , CN , Tautenhahn , T and Van de Velde , S . 1998 . Scheduling a batching machine . J. Sched. , 1 : 31 – 54 .
   Google Scholar
• Chandru , V , Lee , C-Y and Uzsoy , R . 1993 . Minimizing total completion time on batch-processing machines . Int. J. Prod. Res. , 31 ( 9 ) : 2097 – 2121 .
   Web of Science ®Google Scholar
• Coffman , E , Yannakakis , M , Magazine , M and Santos , C . 1990 . Batch sizing and job sequencing on a single machine . Annals of Oper. Res. , 26 : 135 – 147 .
   Google Scholar
• Hochbaum , D and Landy , D . 1997 . Scheduling semiconductor burn-in operations to minimize total flowtime . Oper. Res. , 45 ( 6 ) : 874 – 885 .
   Web of Science ®Google Scholar
• Kanet , JJ and Li , X . 2004 . A weighted modified due date rule for sequencing to minimize weighted tardiness . J. Sched. , 7 : 263 – 278 .
   Web of Science ®Google Scholar
• Kurz , ME . 2003 . On the structure of optimal schedules for minimizing total weighted tardiness on parallel, batch-processing machines . Industrial Engineering Research Conference Proceedings 2003 . 2003 . Portland OR (CD-ROM)
   Google Scholar
• Lawler , EL , Lenstra , JK and Rinnooy Kan , AHG . 1982 . “ Recent developments in deterministic sequencing and scheduling: A survey ” . In Deterministic and Stochastic Scheduling , Edited by: Dempster , MAH , Lenstra , JK and Rinnooy Kan , AHG . 35 – 74 . The Netherlands : D. Reidel Publishing Co. .
   Google Scholar
• Lee , CY and Uzsoy , R . 1999 . Minimizing makespan on a single batch-processing machine with dynamic job arrivals . Int. J. Prod. Res. , 37 : 219 – 236 .
   Web of Science ®Google Scholar
• Lenstra , JK , Rinnooy Kan , AHG and Brucker , P . 1977 . Complexity of machine scheduling problems . Annals of Discrete Mathematics , 1 : 343 – 362 .
   Google Scholar
• Mason , SJ , Fowler , JW and Carlyle , WM . 2002 . A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops . J. Sched. , 5 ( 3 ) : 247 – 262 .
   Web of Science ®Google Scholar
• Mehta , SV and Uzsoy , R . 1998 . Minimizing total tardiness on a batch-processing machine with incompatible job families . IIE Trans. , 30 : 165 – 178 .
   Web of Science ®Google Scholar
• Mönch , 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 . Computers and Oper. Res. , 32 : 2731 – 2750 .
   Web of Science ®Google Scholar
• Perez , IC , Fowler , JW and Carlyle , WM . 2005 . Minimizing total weighted tardiness on a single batch process with incompatible job families . Computers and Oper. Res. , 32 : 327 – 341 .
   Web of Science ®Google Scholar
• Potts , C , Strusevich , V and Tautenhahn , T . 2001 . Scheduling batches with simultaneous job processing for two-machine shop problems . J. Sched. , 4 ( 1 ) : 25 – 51 .
   Web of Science ®Google Scholar
• Sung , C and Choung , Y . 2000 . Minimizing makespan on a single burn-in oven in semiconductor manufacturing . Eur. J. Oper. Res. , 120 : 559 – 574 .
   Web of Science ®Google Scholar
• Uzsoy , R . 1995 . Scheduling batch-processing machines with incompatible job families . Int. J. Prod. Res. , 33 ( 10 ) : 2685 – 2708 .
   Web of Science ®Google Scholar
• Van der Zee , D-J , van Harten , A and Schuur , P . 2001 . On-line scheduling of multi-server batch operations . IIE Trans. , 33 : 569 – 586 .
   Web of Science ®Google Scholar
• Vepsalainen , A and Morton , TE . 1987 . Priority rules and lead time estimation for job shop scheduling with weighted tardiness costs . Manage. Sci. , 33 : 1036 – 1047 .
   Web of Science ®Google Scholar