Abstract
This paper considers the problem of scheduling a single machine to minimize the number of late jobs in the presence of sequence-independent family set-up times. The jobs are partitioned into families, and a set-up time is required at the start of each batch, where a batch is a maximal set of jobs in the same family that are processed consecutively. We design branch and bound algorithms that have several alternative features. Lower bounds can be derived by relaxing either the set-up times or the due dates. A first branching scheme uses a forward branching rule with a depth-first search strategy. Dominance criteria, which determine the order of the early jobs within each family and the order of the batches containing early jobs, can be fully exploited in this scheme. A second scheme uses a ternary branching rule in which the next job is fixed to be early and starting a batch, to be early and not starting a batch, or to be late. The different features are compared on a large set of test problems, where the number of jobs ranges from 30 to 50 and the number of families ranges from 4 to 10.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bruno, J. and P. Downey, “Complexity of task sequencing with deadlines, set-up times and changeover costs” SIAM J. Computing, 7(4), 393–404 (1978).
Crauwels, H. A. J., C. N. Potts, and L. N. Van Wassenhove, “Local search heuristics for single machine scheduling with batching to minimize the number of late jobs” European Journal of Operational Research, 90, 200–213 (1996).
Dunstall, S., A. Wirth, and K. R. Baker, “Lower bounds and algorithms for flowtime minimization on a single machine with set-up times” Journal of Scheduling, 3, 51–69 (2000).
Hariri, A. M. A. and C. N. Potts, “Single machine scheduling with batch set-up times to minimize maximum lateness” Annals of Operations Research, 70, 75–92 (1997).
Monma, C. L. and C. N. Potts, “On the complexity of scheduling with batch setup times” Operations Research, 37, 798–804 (1989).
Moore, J. M., “An n job, one machine sequencing algorithm for minimizing the number of late jobs” Management Science, 15, 102–109 (1968).
Potts, C. N. and M. Y. Kovalyov, “Scheduling with batching: a review” European Journal of Operational Research, 120, 228–249 (2000).
Potts, C. N. and Van L. N. Wassenhove, “Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity” Journal of the Operational Research Society, 43, 395–406 (1992).
Webster, S. and K. R. Baker, “Scheduling groups of jobs on a single machine” Operations Research, 43, 692–703 (1995).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Crauwels, H.A.J., Potts, C.N., Oudheusden, D.V. et al. Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs. J Sched 8, 161–177 (2005). https://doi.org/10.1007/s10951-005-6365-4
Issue Date:
DOI: https://doi.org/10.1007/s10951-005-6365-4