Skip to main content
SpringerLink
Log in

Single-machine scheduling with periodic maintenance to minimize makespan revisited

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

In this paper, a single-machine scheduling problem with periodic maintenance and non-preemptive jobs is considered. The objective is to minimize the makespan. It shows that the classical list scheduling (LS) algorithm, the longest processing time first (LPT) algorithm, and the modified longest processing time first (MLPT) algorithm all have the same worst-case ratio and the same computational complexity for the considered problem. To compare the performances of three considered algorithms in detail, the worst-case ratios of algorithms are formed as single-variable functions of the total number of maintenance activities needed in the optimal schedule. Analysis results show that the bound associated with the LS algorithm is always dominated by the bound associated with the LPT algorithm, and the latter is always dominated by the bound associated with the MLPT algorithm.

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

Fig. 1
Fig. 2

References

  • Breit, J. (2007). Improved approximation for non-preemptive single machine flowtime scheduling with an availability constraint. European Journal of Operational Research, 183, 516–524.

    Article  Google Scholar 

  • Chen, J. S. (2008). Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan. European Journal of Operational Research, 190, 90–102.

    Article  Google Scholar 

  • Cheng, T. C. E., & Wang, G. (1999). Two-machine flowshop scheduling with consecutive availability constraints. Information Processing Letters, 71, 49–54.

    Article  Google Scholar 

  • Cheng, T. C. E., & Wang, G. (2000). An improved heuristic for two-machine flowshop scheduling with an availability constraint. Operations Research Letters, 26, 223–229.

    Article  Google Scholar 

  • Dosa, G. (2007). The tight bound of first fit decreasing bin-packing algorithm is FFD(I) \(\le \) (11/9)OPT (I)+6/9. Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, 4614, 1–11.

    Article  Google Scholar 

  • Gawiejnowicz, S. (2007). Scheduling deteriorating jobs subject to job or machine availability constraints. European Journal of Operational Research, 180, 472–478.

    Article  Google Scholar 

  • Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. The Bell System Technical Journal, 45, 1563–1581.

    Article  Google Scholar 

  • Ji, M., He, Y., & Cheng, T. C. E. (2007). Single-machine scheduling with periodic maintenance to minimize makespan. Computers and Operations Research, 34, 1764–1770.

    Article  Google Scholar 

  • Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., & Graham, R. L. (1974). Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3, 299–325.

    Article  Google Scholar 

  • Johnson, D. S., & Garey, M. R. (1985). A 71/60 theorem for bin packing. Journal of Complexity, 1(1), 65–106.

    Article  Google Scholar 

  • Kacem, I. (2008). Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Computers, Industrial Engineering, 154, 401–410.

    Article  Google Scholar 

  • Xia, B. Z., & Tan, Z. Y. (2010). Tighter bounds of the first fit algorithm for the bin-packing problem. Discrete Applied Mathematics, 158(15), 1668–1675.

    Article  Google Scholar 

  • Xu, D. H., Yin, Y. Q., & Li, H. X. (2009). A note on “scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan”. European Journal of Operational Research, 197, 825–827.

    Article  Google Scholar 

  • Xu, D. H., & Yin, Y. Q. (2011). On single-machine scheduling with flexible maintenance activities. International Journal of Advanced Manufacturing Technology, 56, 1139–1145.

    Article  Google Scholar 

  • Yue, M. Y. (1991). A simple proof of the inequality FFD(L) \(\le \) (11/9) OPT(L) + 1, for all L, for the FFD bin-packing algorithm. Acta Mathematicae Applicatae Sinica, 7(4), 321–331.

    Article  Google Scholar 

  • Yue, M. Y., & Zhang, L. (1995). A simple proof of the inequality MFFD(L)\(\le \) 71/60 OPT(L) + 1, L for the MFFD bin-packing algorithm. Acta Mathematicae Applicatae Sinica, 11(3), 318–330.

    Article  Google Scholar 

Download references

Acknowledgments

The authors wish to thank the editors and the anonymous referees for their helpful comments on the earlier versions of this paper. This work is supported by the National Nature Science Foundation of China (71171046), the College Graduate Research and Innovation Foundation of Jiangsu Province (CXLX 0162), and the Scientific Research Foundation of Graduate School of Southeast University (YBJJ1239).

Author information

Authors and Affiliations

  1. School of Economics and Management, Southeast University, Nanjing, 210096, China

    Xianyu Yu & Yulin Zhang

  2. DeGroote School of Business, McMaster University, Hamilton, ON, Canada

    Xianyu Yu & George Steiner

Authors
  1. Xianyu Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yulin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. George Steiner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yulin Zhang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yu, X., Zhang, Y. & Steiner, G. Single-machine scheduling with periodic maintenance to minimize makespan revisited. J Sched 17, 263–270 (2014). https://doi.org/10.1007/s10951-013-0350-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-013-0350-0

Keywords

Search

Navigation