Abstract
In this paper we study the problem of scheduling n jobs with release dates, due dates, weights, and equal processing times on a single machine. The objective is to minimize total weighted tardiness. We formulate the problem as a time-indexed ILP after which we solve the LP-relaxation. We show that for certain special cases (namely when either all due dates, all weights, or all release dates are equal, or when all due dates and release dates are equally ordered), the solution for the LP-relaxation is either integral or can be adjusted in polynomial time into an integral one. For the general case we present a branching rule that performs well. Furthermore we show that the same approach holds for the m identical, parallel machines variant of the problem. Finally we show that with a minor modification the same approach also holds for the single-machine problems of minimizing the sum of weighted late jobs (1|r j ,p j =p|∑w j U j ) and the sum of weighted late work (1|r j ,p j =p|∑w j V j ) as well as their respective variants with m identical, parallel machines. We further show how we can solve these problems by applying column generation when there is not sufficient memory available to apply the direct ILP-approach.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Akturk, M. S., & Ozdemir, D. (2001). A new dominance rule to minimize total weighted tardiness with unequal release dates. European Journal of Operational Research, 135, 394–412.
Baptiste, P. (1999). Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. Journal of Scheduling, 2, 245–252.
Baptiste, P. (2000). Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics, 103(1–3), 21–32.
Baptiste, P., Brucker, P., Knust, S., & Timkovsky, V. (2004). Ten notes on equal-processing-time scheduling. 4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 2, 111–127.
Bigras, L.-P., Gamache, M., & Savardan, G. (2005). Time-indexed formulations and the total weighted tardiness problem. Technical report, GERAD and ’Ecole Polytechnique de Montréal.
Du, J., & Leung, J. Y. T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15(3), 483–495.
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.
ILOG (2005). ILOG CPLEX v9.1, http://www.ilog.fr.
Lawler, E. L. (1977). A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics, 1, 331–342.
Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343–362.
Leung, J. Y.-T. (2004). Handbook of scheduling. New York: Chapmann & Hall/CRC.
Nemhauser, G. L., & Wolsey, L. A. (1988). Integer and combinatorial optimization. Wiley-interscience series in discrete mathematics and optimization. New York: Wiley.
Roos, C. (2005). Private communication.
Verma, S., & Dessouky, M. (1998). Single-machine scheduling of unit-time jobs with earliness and tardiness penalties. Mathematics of Operations Research, 23(4), 930–943.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by BSIK grant 03018 (BRICKS: Basic Research in Informatics for Creating the Knowledge Society).
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., Diepen, G. & Hoogeveen, J.A. Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs. J Sched 13, 561–576 (2010). https://doi.org/10.1007/s10951-010-0181-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-010-0181-1