Skip to main content
SpringerLink
Log in

Approximation algorithms for the single-machine scheduling with a period of maintenance

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

Abstract

We consider a single machine scheduling problem of minimizing total completion time subject to a period of maintenance, and design an \(O(nlogn)\) time algorithm with a tight performance ratio of \(17/15\). Then, we study an integrated production and distribution problem, in which jobs are delivered by one vehicle to a customer after they are completed on a single machine with a period of maintenance. The objective is to minimize total delivery time of the jobs. We develop a \(3/2\)-approximation algorithm with \(O(n^{3})\) time complexity.

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. Ahmadi, J.H., Ahmadi, R.H., Dasu, S., Tang, C.S.: Batching and scheduling jobs on batch and discrete processors. Oper. Res. 39, 750–763 (1992)

    Article  MathSciNet  Google Scholar 

  2. Adiri, I., Bruno, J., Frostig, E.: Single machine flow-time scheduling with a single breakdown. Acta Inform. 26, 679–696 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  3. Breit, J.: Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint. Eur. J. Oper. Res. 183, 516–524 (2007)

    Article  MATH  Google Scholar 

  4. Chen, Z.L., Vairaktarakis, G.L.: Integrated scheduling of production and distribution operations. Manag. Sci. 51, 614–628 (2005)

    Article  MATH  Google Scholar 

  5. Chen, Z.L.: Integrated production and outbound distribution scheduling: review and extensions. Oper. Res. 58, 130–148 (2010)

    Article  MATH  Google Scholar 

  6. Chen, Z.L., Pundoor, G.: Order assignment and scheduling in a supply chain. Oper. Res. 54, 555–572 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. 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 

  8. Dobson, G., Karmarkar, U.S., Rummel, J.L.: Batching to minimize flow times on parallel heterogeneous machines. Manag. Sci. 35, 607–613 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hall, N.G., Potts, C.N.: Supply chain scheduling: batching and delivery. Oper. Res. 51, 566–584 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hall, N.G., Potts, C.N.: The coordination of scheduling and batch deliveries. Ann. Oper. Res. 135, 41–64 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lee, C.Y., Liman, S.D.: Single machine flow-time scheduling with scheduled maintenance. Acta Inform 29, 375–382 (1992)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Li, C.L., Vairaktarakis, G., Lee, C.Y.: Machine scheduling with deliveries to multiple customer locations. Eur. J. Oper. Res. 164, 39–51 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. Li, C.L., Vairaktarakis, G.: Coordinating production and distribution of jobs with bundling operations. IIE Trans. 39, 203–215 (2007)

    Article  Google Scholar 

  15. Pundoor, G., Chen, Z.L.: Scheduling a production-distribution system to optimize the tradeoff between delivery tardiness and total distribution cost. Nav. Res. Logist. 52, 571–589 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  16. Sadfi, C., Penz, B., Rapine, C.: A dynamic programming algorithm for the single machine total completion time scheduling problem with availability constraints. In: Proceedings of the Eighth International Workshop on Project Management and Scheduling-PMS, Valencia, Spain (2002)

  17. Sadfi, C., Penz, B., Rapine, C., Blażewicz, J., Formanowicz, P.: An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. Eur. J. Oper. Res. 161, 3–10 (2005)

    Article  MATH  Google Scholar 

  18. Sanlaville, E., Schmidt, G.: Machine scheduling with availability constraints. Acta Inform. 35, 795–811 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  19. Santos, C., Magazine, M.: Batching in single operation manufacturing systems. Oper. Res. Lett. 4, 99–103 (1985)

    Article  MATH  Google Scholar 

  20. Schmidt, G.: Scheduling with limited machine availability. Eur. J. Oper. Res. 121, 1–15 (2000)

    Article  MATH  Google Scholar 

  21. Tang, C.S.: Scheduling batches on parallel machines with major and minor set-ups. Eur. J. Oper. Res. 46, 28–37 (1990)

    Article  MATH  Google Scholar 

  22. Ullrich, C.A.: Integrated machine scheduling and vehicle routing with time windows. Eur. J. Oper. Res. 227, 152–165 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  23. Wang, H., Lee, C.Y.: Production and transport logistics scheduling with two transport mode choices. Nav. Res. Logist. 52, 796–809 (2005)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  25. Wang, X., Cheng, T.C.E.: Production scheduling with supply and delivery considerations to minimize the makespan. Eur. J. Oper. Res. 194, 743–752 (2009)

    Article  MATH  Google Scholar 

  26. Zhong, W.Y., Chen, Z.L., Chen, M.: Integrated production and distribution scheduling with committed delivery dates. Oper. Res. Lett. 38, 133–138 (2010)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This research is supported by National Natural Science Foundation of China (11371137), Research Fund for the Doctoral Program of China (20120074110021).

Author information

Authors and Affiliations

  1. Department of Mathematics, School of Science, East China University of Science and Technology, Shanghai, 200237, China

    Ganggang Li & Xiwen Lu

Authors
  1. Ganggang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiwen Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiwen Lu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, G., Lu, X. Approximation algorithms for the single-machine scheduling with a period of maintenance. Optim Lett 10, 543–562 (2016). https://doi.org/10.1007/s11590-015-0881-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-015-0881-8

Keywords

Search

Navigation