Skip to main content
SpringerLink
Log in

Machine scheduling with a maintenance interval and job delivery coordination

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We investigate a scheduling problem with job delivery coordination in which the machine has a maintenance time interval. The goal is to minimize the makespan. In the problem, each job needs to be processed on the machine non-preemptively for a certain time, and then transported to a distribution center, by one vehicle with a limited physical capacity. We present a 2-approximation algorithm for the problem, and show that the performance ratio is tight.

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

Similar content being viewed by others

References

  1. Chang, Y.-C., Lee, C.-Y.: Machine scheduling with job delivery coordination. Eur. J. Oper. Res. 158, 470–487 (2004)

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  3. Garey, M.R., Johnson, D.S.: A \(71/60\) theorem for bin-packing. J. Complex. 1, 65–106 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  4. He, Y., Zhong, W., Gu, H.: Improved algorithms for two single machine scheduling problems. Theor. Comput. Sci. 363, 257–265 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Johnson, D.S.: Near-optimal allocation algorithms. Ph.D. thesis, Massachusetts Institute of Technology (1973)

  6. Lee, C.-Y., Chen, Z.-L.: Machine scheduling with transportation considerations. J. Sched. 4, 3–24 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lee, C.-Y., Lei, L., Pinedo, M.: Current trends in deterministic scheduling. Ann. Oper. Res. 70, 1–41 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lu, L., Yuan, J.: Single machine scheduling with job delivery to minimize makespan. Asia-Pac. J. Oper. Res. 25, 1–10 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Wang, X., Cheng, T.C.E.: Machine scheduling with an availability constraint and job delivery coordination. Naval Res. Logist. 54, 11–20 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Zhong, W., Dósa, G., Tan, Z.: On the machine scheduling problem with job delivery coordination. Eur. J. Oper. Res. 182, 1057–1072 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

Hu is supported by the National Natural Science Foundation of China (NNSF) Grants No. 11271324 and 11471286. Luo is supported by a sabbatical research grant of Lin; his work was mostly done during his visit to the UofA. Dong is supported by the Zhejiang Provincial Natural Science Foundation Grants No. LY13A010015 and the Science Foundation of Zhejiang Sci-Tech University (ZSTU) Grants No. 13062171-Y. Tong is supported by an Alberta Innovates Technology Futures (AITF) Graduate Student Scholarship. Goebel is supported by AITF and the Natural Sciences and Engineering Research Council of Canada (NSERC). Xu is supported by the NNSF Grants No. 61221063 and 71371129, and the Program for Changjiang Scholars and Innovative Research Team in University Grant No. IRT1173. Lin is supported by NSERC, the NNSF Grant No. 61471124, and the Science Foundation of Zhejiang Sci-Tech University (ZSTU) Grants No. 14062170-Y; his work was mostly done during his sabbatical leave at the ZSTU. The authors are grateful to the anonymous referees for many constructive comments on an earlier version of the paper.

Author information

Authors and Affiliations

  1. Department of Mathematics, Zhejiang Sci-Tech University, Hangzhou, 310018, Zhejiang, China

    Jueliang Hu, Xiaotong Su, Jianming Dong & Guohui Lin

  2. Business School, Sichuan University, Chengdu, 610065, Sichuan, China

    Taibo Luo & Yinfeng Xu

  3. Department of Computing Science, University of Alberta, Edmonton, AB, T6G 2E8, Canada

    Taibo Luo, Weitian Tong, Randy Goebel & Guohui Lin

  4. State Key Lab for Manufacturing Systems Engineering, Xi’an, 710049, Shaanxi, China

    Yinfeng Xu

Authors
  1. Jueliang Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Taibo Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaotong Su
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jianming Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Weitian Tong
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Randy Goebel
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Yinfeng Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Guohui Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guohui Lin.

Additional information

J. Hu and T. Luo are co-first authors.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hu, J., Luo, T., Su, X. et al. Machine scheduling with a maintenance interval and job delivery coordination. Optim Lett 10, 1645–1656 (2016). https://doi.org/10.1007/s11590-015-0939-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-015-0939-7

Keywords

Search

Navigation