Skip to main content
SpringerLink
Log in

The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

In this paper, we consider the single machine batching problem with family setup times to minimize maximum lateness. While the problem was proved to be binary NP-hard in 1978, whether the problem is strongly NP-hard is a long-standing open question. We show that this problem is strongly NP-hard.

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

  • Bruno, J. and P. Downey, “Complexity of task sequencing with deadlines, setup times and changeover costs,” SIAM J. Comput., 7, 393-404 (1978).

    Google Scholar 

  • Garey, M.R. and D.S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness,” Freeman, San Francisco, CA, 1979.

    Google Scholar 

  • Gerodimos, A.E., C.A. Glass, C.N. Potts, and T. Tautenhahn, “Scheduling multi-operation jobs on a single machine,” Ann. Oper. Res., 92, 87-105 (1999).

    Google Scholar 

  • Ghosh, J.B. and J.N.D. Gupta, “Batch scheduling to minimize maximum lateness,” Oper. Res. Lett., 21, 77-80 (1997).

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Logistics, Faculty of Business, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, People's Republic of China

    T.C.E. Cheng & C.T. Ng

  2. Department of Mathematics, Zhengzhou University, Zhengzhou, Henan, 450052, People's Republic of China

    J.J. Yuan

Authors
  1. T.C.E. Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C.T. Ng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J.J. Yuan
    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

Cheng, T., Ng, C. & Yuan, J. The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard. Journal of Scheduling 6, 483–490 (2003). https://doi.org/10.1023/A:1024858623282

Download citation

  • Issue Date:

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

Search

Navigation