Abstract
In this paper we consider the parallel machine scheduling problem of minimizing an objective function of the minmax type, like maximum lateness, subject to release dates, deadlines, and/or generalized precedence constraints. We use a destructive strategy to compute a lower bound. Here we test the feasibility of a decision problem by applying column generation to compute a bound on the number of machines that we need to feasibly accommodate all jobs.
After having derived the lower bound, we try to find a matching upper bound by identifying a feasible schedule with objective function value equal to this lower bound. Our computational results show that our lower bound is so strong that this is almost always possible. We are able to solve problems with up to 160 jobs and 10 machines in 10 minutes on average.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-based scheduling: applying constraint programming to scheduling problems. Dordrecht: Kluwer Academic.
Bazaraa, M. S., Jarvis, J. J., & Sherali, H. D. (1990). Linear programming and network flows. New York: Wiley.
Brucker, P., & Knust, S. (2000). A linear programming and constraint propagation-based lower bound for the RCPSP. European Journal of Operational Research, 127, 355–362.
Brucker, P., & Knust, S. (2002). Lower bounds for scheduling a single robot in a job-shop environment. Annals of Operations Research, 115, 147–172.
Brucker, P., & Knust, S. (2003). Lower bounds for resource-constrained project scheduling problems. European Journal of Operational Research, 149, 302–313.
Carlier, J. (1987). Scheduling jobs with release dates and tails on identical machines to minimize the makespan. European Journal of Operational Research, 29, 298–306.
Chen, Z. L., & Powell, W. B. (1999). Solving parallel machine scheduling problems by column generation. INFORMS Journal on Computing, 11, 78–94.
de Sousa, J. P., & Wolsey, L. A. (1992). A time-indexed formulation of non-preemptive single-machine scheduling problems. Mathematical Programming, 54, 353–367.
Garey, M. R., Tarjan, R. E., & Wilfong, G. T. (1988). One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research, 13, 330–348.
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287–326.
Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness (Research Report 43). Management Sciences Research Project, UCLA.
Lawler, E. L., & Moore, J. M. (1969). A functional equation and its application to resource allocation and sequencing problems. Management Science, 16, 77–84.
van den Akker, J. M. (1994). LP-based solution methods for single-machine scheduling problems. PhD thesis, Eindhoven University of Technology.
van den Akker, J. M., Hoogeveen, J. A., & Van de Velde, S. L. (1999). Parallel machine scheduling by column generation. Operations Research, 47, 862–872.
van den Akker, J. M., Hoogeveen, J. A., & Van de Velde, S. L. (2005). Applying column generation to machine scheduling. In G. Desaulniers, J. Desrosiers, & M. M. Solomon (Eds.), Column generation (pp. 303–330). Berlin: Springer.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
van den Akker, J.M., Hoogeveen, J.A. & van Kempen, J.W. Using column generation to solve parallel machine scheduling problems with minmax objective functions. J Sched 15, 801–810 (2012). https://doi.org/10.1007/s10951-010-0191-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-010-0191-z