Machine Scheduling with a Maintenance Interval and Job Delivery Coordination
Contribution to Book
Proceedings of the International Workshop on Frontiers of Algorithmics
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.
Lu, Jueliang, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong, Randy Goebel, Yinfeng Xu, Guohui Lin.
"Machine Scheduling with a Maintenance Interval and Job Delivery Coordination."
Proceedings of the International Workshop on Frontiers of Algorithmics, Jianxin Wang and Chee Yap (Ed.), 9130: 104-114 Cham, Switzerland: Springer International Publishing.
doi: https://doi.org/10.1007/978-3-319-19647-3_10 source: https://link.springer.com/chapter/10.1007%2F978-3-319-19647-3_10 isbn: 978-3-319-19647-3