Machine scheduling with a maintenance interval and job delivery coordination
- 305 Downloads
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.
KeywordsScheduling Machine maintenance Job delivery Bin-packing Approximation algorithm Worst-case performance analysis
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.
- 5.Johnson, D.S.: Near-optimal allocation algorithms. Ph.D. thesis, Massachusetts Institute of Technology (1973)Google Scholar