Skip to main content
SpringerLink
Log in

Tower-of-sets analysis for the Kise–Ibaraki–Mine algorithm

  • Short Communication
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

Kise et al. (Oper. Res. 26:121–126, 1978) give an O(n 2) time algorithm to find an optimal schedule for the single-machine number of late jobs problem with agreeable job release dates and due dates. Li et al. (Oper. Res. 58:508–509, 2010a) point out that their proof of optimality for their algorithm is incorrect by giving a counter-example. In this paper, using the concept of “tower-of-sets” from Lawler (Math. Comput. Model. 20:91–106, 1994), we construct the tower-of-sets of the early job set generated by the algorithm. Then we give a correct proof of optimality for the algorithm and show a new result that the early job set by the algorithm obtains not only the maximum number of jobs but also the smallest total processing time among all optimal schedules. The result can be applied to study the problems of the hard real-time systems.

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

References

  1. Baptiste P.: An O(n 4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Oper. Res. Lett. 24, 175–180 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Baptiste P., Peridy L., Pinson E.: A branch and bound to minimize the number of late jobs on a single machine with release time constraints. Eur. J. Oper. Res. 144, 1–11 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dauzere-Peres A., Sevaux M.: An exact method to minimize the number of tardy jobs in single machine scheduling. J. Sched. 7, 405–420 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Garey M.R., Johnson D.S.: Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman Company, San Francisco (1979)

    MATH  Google Scholar 

  5. Hwang S.H., Cheng S.T.: Combinatorial optimization in real-time scheduling: theory and algorithms. J. Comb. Optim. 5, 345–375 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kise H., Ibaraki T., Mine H.: A solvable case of the one-machine scheduling problem with ready and due times. Oper. Res. 26, 121–126 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lenstra J.K., Rinnooy Kan A.H.G., Brucker P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343–362 (1977)

    Article  MathSciNet  Google Scholar 

  8. Lawler E.L.: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Ann. Oper. Res. 26, 125–133 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lawler E.L.: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the “tower of sets” property. Math. Comput. Model. 20, 91–106 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  10. Li S., Chen Z.L., Tang G.: A note on the optimality proof of the Kise–Ibaraki–Mine algorithm. Oper. Res. 58, 508–509 (2010a)

    Article  MathSciNet  MATH  Google Scholar 

  11. Li, S., Chen, Z.L., Tang, G.: Optimality proof of the Kise-Ibaraki-Mine algorithm. J. Sched. (2010b, to appear)

  12. Moore J.M.: An n job, one machine sequencing algorithm for minimizing the number of late jobs. Manage. Sci. 15, 102–109 (1968)

    Article  MATH  Google Scholar 

  13. Pinedo M.: Scheduling Theory, Algorithms, and Systems, 2nd edn. Prentice Hall, Upper Saddle River, New Jersey (2002)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Taizhou University, Taizhou, Zhejiang, 317000, People’s Republic of China

    Maoqin Li

  2. Department of Mathematics, Taiyuan Normal University, Taiyuan, Shanxi, 030012, People’s Republic of China

    Shanlin Li

  3. Department of Logistics and Maritime Studies, Hong Kong Polytechnic University, Kowloon, Hong Kong

    Hong Yan

Authors
  1. Maoqin Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shanlin Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hong Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maoqin Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, M., Li, S. & Yan, H. Tower-of-sets analysis for the Kise–Ibaraki–Mine algorithm. Optim Lett 7, 1017–1026 (2013). https://doi.org/10.1007/s11590-012-0480-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-012-0480-x

Keywords

Search

Navigation