Abstract
We consider the following single machine just-in-time scheduling problem with earliness and tardiness costs: Given n jobs with processing times, due dates and job weights, the task is to schedule these jobs without preemption on a single machine such that the total weighted discrepancy from the given due dates is minimum.
NP-hardness of this problem is well established, but no approximation results are known. Using the gap-technique, we show in this paper that the weighted earliness–tardiness scheduling problem and several variants are extremely hard to approximate: If n denotes the number of jobs and b∈ℕ is any given constant, then no polynomial-time algorithm can achieve an approximation which is guaranteed to be at most a factor of O(b n) worse than the optimal solution unless P = NP.
We also present positive results for two special cases. If the individual processing times and likewise the job weights are similar, i.e., they deviate from each other only by a constant factor, then we obtain constant approximation ratios in pseudopolynomial time. For the second special case, we assume only a constant number of distinct due dates. Then we obtain a pseudopolynomial time exact algorithm using an adaption of a dynamic programming approach introduced by Kolliopoulos and Steiner (Theoretical Computer Science 355:261–273, 2006) for the total weighted tardiness problem.
Similar content being viewed by others
References
Brenner, U., & Vygen, J. (2000). Faster optimal single-row placement with fixed ordering. In Proceedings of the conference design, automation and test in Europe (pp. 117–121). New York: IEEE.
Bülbül, K., Kaminsky, P., & Yano, C. (2007). Preemption in single machine earliness/tardiness scheduling. Journal of Scheduling, 10, 271–292.
Garey, M. R., & Johnson, D. S. (1976). The complexity of near-optimal coloring. Journal of the ACM, 23, 43–49.
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.
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.
Hall, N. G., & Posner, M. E. (1991). Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due-date. Operations Research, 39(5), 836–846.
Hassin, R., & Shani, M. (2005). Machine scheduling with earliness, tardiness and non-execution penalties. Computers & Operations Research, 32, 683–705.
Hoogeveen, H. (2005). Multicriteria scheduling. European Journal of Operational Research, 167, 592–623.
Hoogeveen, J. A., & van de Velde, S. L. (1991). Scheduling around a small common due date. European Journal of Operational Research, 55, 237–242.
Kanet, J. J. (1981). Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics Quarterly, 28, 643–651.
Kolliopoulos, S. G., & Steiner, G. (2006). Approximation algorithms for minimizing the total weighted tardiness on a single machine. Theoretical Computer Science, 355, 261–273.
Kovalyov, M. Y., & Kubiak, W. (1999). A fully polynomial approximation scheme for the weighted earliness–tardiness problem. Operations Research, 47, 757–761.
Lawler, E. L. (1977). A ‘pseudopolynomial’ algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics, 1, 331–342.
Sourd, F., & Kedad-Sidhoum, S. (2003). The one machine problem with earliness and tardiness penalties. Journal of Scheduling, 6, 533–549.
Sourd, F., & Kedad-Sidhoum, S. (2005). An efficient algorithm for the earliness–tardiness scheduling problem (Tech. rep.). LIP6 – SYSDEF, Université Pierre et Marie Curie, Paris, France.
Verma, S., & Dessouky, D. (1998). Single-machine scheduling of unit-time jobs with earliness and tardiness penalties. Mathematics of Operations Research, 23, 930–943.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Müller-Hannemann, M., Sonnikow, A. Non-approximability of just-in-time scheduling. J Sched 12, 555–562 (2009). https://doi.org/10.1007/s10951-009-0120-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-009-0120-1