Skip to main content
SpringerLink
Log in

A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

We consider the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs. Each job consists of several operations that belong to different families. In a schedule, each family of job operations may be processed in batches with each batch incurring a setup time. A job completes when all of its operations have been processed. The objective is to minimize the number of tardy jobs. In the literature, this problem has been proved to be strongly NP-hard for arbitrary due-dates. We show in this paper that the problem remains strongly NP-hard even when the due-dates are common and all jobs have the same processing time.

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

  • 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 

  • 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 

  • Papadimitriou, C. H. and K. Steiglitz, “Combinatorial Optimization,” Prentice-Hall, Englewood Cliffs, NJ, 1982.

    Google Scholar 

  • Papadimitriou, C. H., “Computational Complexity,” Addison-Wesley, New York, 1994.

    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

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

  2. Department of Mathematics, Zhengzhou University, 450052, Henan, Zhengzhou, 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.C.E., Ng, C.T. & Yuan, J.J. A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs. Journal of Scheduling 6, 551–555 (2003). https://doi.org/10.1023/A:1026276627133

Download citation

  • Issue Date:

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

Search

Navigation