Batch scheduling to minimize maximum lateness

We address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, we give an improved dynamic program for the solution of the problem.

[1]  Jay B. Ghosh.  Batch scheduling to minimize total completion time , 1994, Oper. Res. Lett..

[2]  Stanisław Zdrzałka.  Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times , 1995 .

[3]  Universityof Twente.  Single-machine scheduling with release dates, due dates and family setup times , 1995 .

[4]  Kenneth R. Baker,et al.  Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..

[5]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[6]  Chris N. Potts,et al.  Scheduling two job classes on a single machine , 1991, Comput. Oper. Res..

[7]  Whm Henk Zijm,et al.  Single-machine scheduling with release dates, due dates and family setup times , 1994 .

[8]  Clyde L. Monma,et al.  On the Complexity of Scheduling with Batch Setup Times , 1989, Oper. Res..

[9]  John L. Bruno,et al.  Task Sequencing in a Batch Environment with Setup Times , 1976, Performance.

[10]  Stanisłlaw Zdrzałka.  Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times , 1991 .

[11]  Chris N. Potts,et al.  Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity , 1992 .

[12]  John L. Bruno,et al.  Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs , 1978, SIAM J. Comput..

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .