Abstract
Given a single machine and a set of jobs with due dates, the classical NP-hard problem of scheduling to minimize total tardiness is a well-understood one. Lawler gave an FPTAS for it some twenty years ago. If the jobs have positive weights the problem of minimizing total weighted tardiness seems to be considerably more intricate. To our knowledge there are no approximability results for it. In this paper, we initiate the study of approximation algorithms for the problem. We examine first the weighted problem with a fixed number of due dates and we design a pseudopolynomial algorithm for it. We show how to transform the pseudopolynomial algorithm to an FPTAS for the case where the weights are polynomially bounded. For the general case with an arbitrary number of due dates, we provide a quasipolynomial randomized algorithm which produces a schedule whose expected value has an additive error proportional to the weighted sum of the due dates.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Congram, R.K., Potts, C.N., van de Velde, S.L.: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing 14(1), 52–67 (2002)
Du, J., Leung, J.Y.T.: Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15, 483–495 (1990)
Lawler, E.L.: A ”pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics 1, 331–342 (1977)
Lawler, E.L.: A fully polynomial approximation scheme for the total tardiness problem. Operations Research Letters 1, 207–208 (1982)
Lawler, E.L., Moore, J.M.: A functional equation and its application to resource allocation and sequencing problems. Management Science 16, 77–84 (1969)
Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics 1, 343–362 (1977)
McNaughton, R.: Scheduling with deadlines and loss functions. Management Science 6, 1–12 (1959)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kolliopoulos, S.G., Steiner, G. (2004). On Minimizing the Total Weighted Tardiness on a Single Machine. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive