Skip to main content
SpringerLink
Log in

Minimizing maximum absolute lateness and range of lateness under generalizeddue dates on a single machine

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We investigate the problems of minimizing the maximum absolute lateness and range oflateness under generalized due dates on a single machine. In contrast to the traditional duedate cases, we show that these problems are unary NP‐hard. Furthermore, we present simpleapproximation algorithms for these problems, and show that they achieve the performanceratios of n for the problem of minimizing the maximum absolute lateness and of [ n/2 ] forthe problem of minimizing the range of lateness, where [ x ] is the smallest integer no lessthan x.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K.R. Baker, Introduction to Sequencing and Scheduling, Wiley, New York, 1974.

    Google Scholar 

  2. J. Browne, D. Dubois, K. Rathmill, S.P. Sethi and K. Stecke, Classification of flexible manufacturing systems, The FMS Magazine (Apr. 1984)114-117.

  3. R.W. Conway, W.L. Maxwell and L.W. Miller, Theory of Scheduling, Addison-Wesley, MA, 1967.

    Google Scholar 

  4. J. Du and J.Y.-T. Leung, Minimizing total tardiness on one machine is NP-hard, Mathematics of Operations Research 15(1990)483-495.

    Google Scholar 

  5. M.R. Garey and D.S. Johnson, Computers and Intractability — A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.

    Google Scholar 

  6. M.R. Garey, R.E. Tarjan and G.T. Wilfong, One-processor scheduling with symmetric earliness and tardiness penalties, Mathematics of Operations Research 13(1988)330-348.

    Google Scholar 

  7. N.G. Hall, Scheduling problems with generalized due dates, IIE Transactions 18(1986)220-222.

    Google Scholar 

  8. N.G. Hall, S.P. Sethi and C. Sriskandarajah, On the complexity of generalized due date scheduling problems, European Journal of Operational Research 51(1991)100-109.

    Google Scholar 

  9. J.A. Hoogeveen, Minimizing maximum earliness and maximum lateness on a single machine, Technical Report BS-R9001, Centre for Mathematics and Computer Science, Amsterdam, 1990.

    Google Scholar 

  10. J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Technical Report 43, Management Science Research Project, University of California, Los Angeles, 1955.

    Google Scholar 

  11. J.B. Lasserre and M. Queyranne, Generic scheduling polyhedra and a new mixed-integer formulation for single-machine scheduling, in: Proceedings of the 3rd Conference on Integer Programming and Combinatorial Optimization, Carnegie Mellon, 1992, pp. 136-149.

  12. E.L. Lawler, Optimal sequencing of a single machine subject to precedence constraints, Management Science 19(1973)544-546.

    Google Scholar 

  13. J.K. Lenstra and A.H.G. Rinnooy Kan, Complexity of scheduling under precedence constraints, Operations Research 26(1978)22-35.

    Google Scholar 

  14. J.K. Lenstra and A.H.G. Rinnooy Kan, Complexity results for scheduling chains on a single machine, European Journal of Operational Research 4(1980)270-275.

    Google Scholar 

  15. J.K. Lenstra, A.H.G. Rinnooy Kan and P. Brucker, Complexity of machine scheduling problems, Annals of Discrete Mathematics 1(1977)343-362.

    Google Scholar 

  16. C.-J. Liao and R.H. Huang, An algorithm for minimizing the range of lateness on a single machine, Journal of the Operational Research Society 42(1991)183-186.

    Google Scholar 

  17. J.M. Moore, An n job, one machine sequencing algorithm for minimizing the number of late jobs, Management Science 15(1968)102-109.

    Google Scholar 

  18. C. Sriskandarajah, A note on the generalized due dates scheduling problems, Naval Research Logistics Quarterly 37(1990)587-597.

    Google Scholar 

  19. K.E. Stecke and J.J. Solberg, Loading and control policies for a flexible manufacturing system, International Journal of Production Research 19(1981)481-490.

    Google Scholar 

  20. C.S. Wong, M. Yan and G.H. Young, A note on a single machine generalized due dates scheduling problems, Journal of Combinatorial Mathematics and Combinatorial Computing (Dec. 1993), revised May 1995.

  21. G.H. Young, C.S. Wong, V.S. Yiu and M. Yan, Scheduling tasks with generalized due dates and ready times, in: Proceedings of the 2nd International Symposium on Operations Research and its Applications, Guilin, China, Dec. 1996, pp. 209-214.

Download references

Authors
  1. K. Tanaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Vlach
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tanaka, K., Vlach, M. Minimizing maximum absolute lateness and range of lateness under generalizeddue dates on a single machine. Annals of Operations Research 86, 507–526 (1999). https://doi.org/10.1023/A:1018987625819

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018987625819

Keywords

Search

Navigation