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; transportation is by one vehicle with a limited physical capacity, and it takes constant time to deliver a shipment to the distribution center and return back to the machine. We present a \(2\)-approximation algorithm for the problem, and show that the performance ratio is tight.
J. Hu and T. Luo—Co-first authors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In the literature, non-resumable (specified as “\(nr\text {-}a\)”) has been used.
References
Chang, Y.-C., Lee, C.-Y.: Machine scheduling with job delivery coordination. Eur. J. Oper. Res. 158, 470–487 (2004)
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)
Garey, M.R., Johnson, D.S.: A \(71/60\) theorem for bin-packing. J. Complex. 1, 65–106 (1985)
He, Y., Zhong, W., Gu, H.: Improved algorithms for two single machine scheduling problems. Theoret. Comput. Sci. 363, 257–265 (2006)
Johnson, D.S.; Near-optimal allocation algorithms. Ph.D. thesis, Massachusetts Institute of Technology (1973)
Lee, C.-Y., Chen, Z.-L.: Machine scheduling with transportation considerations. J. Sched. 4, 3–24 (2001)
Lee, C.-Y., Lei, L., Pinedo, M.: Current trends in deterministic scheduling. Ann. Oper. Res. 70, 1–41 (1997)
Lu, L., Yuan, J.: Single machine scheduling with job delivery to minimize makespan. Asia-Pac. J. Oper. Res. 25, 1–10 (2008)
Wang, X., Cheng, T.C.E.: Machine scheduling with an availability constraint and job delivery coordination. Naval Res. Logistics 54, 11–20 (2007)
Zhong, W., Dósa, G., Tan, Z.: On the machine scheduling problem with job delivery coordination. Eur. J. Oper. Res. 182, 1057–1072 (2007)
Acknowledgements
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 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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Hu, J. et al. (2015). Machine Scheduling with a Maintenance Interval and Job Delivery Coordination. In: Wang, J., Yap, C. (eds) Frontiers in Algorithmics. FAW 2015. Lecture Notes in Computer Science(), vol 9130. Springer, Cham. https://doi.org/10.1007/978-3-319-19647-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-19647-3_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19646-6
Online ISBN: 978-3-319-19647-3
eBook Packages: Computer ScienceComputer Science (R0)