We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature that consist of a sorting step to determine an optimal job sequence, followed by a dynamic programming step that determines the optimal batches. In each case, the dynamic program is based on a backward recursion of which a straightforward implementation requires O(n2) time, where n is the number of jobs. We present improved implementations of these dynamic programs that are based on monotonicity properties of the objective expressed as a function of the total processing time of the first batch. These properties and the use of efficient data structures enable optimal solutions to be found for each of the four problems in O(n log n) time; in two cases, the batching step is actually performed in linear time and the overall complexity is determined by the sorting step.

Additional Metadata
Keywords batching, dynamic programming, lateness, omputational complexity, scheduling
Persistent URL dx.doi.org/10.1016/S0167-6377(00)00040-7, hdl.handle.net/1765/14436
Series ERIM Article Series (EAS)
Journal Operations Research Letters
Citation
Wagelmans, A.P.M, & Gerodimos, A.E. (2000). Improved dynamic programs for some batching problems involving the maximum lateness criterion. Operations Research Letters, 27(3), 109–118. doi:10.1016/S0167-6377(00)00040-7