Machine Scheduling with a Maintenance Interval and Job Delivery Coordination

Authors

Jueliang Lu, Zhejiang Sci-Tech University
Taibo Luo, Sichuan UniversityFollow
Xiaotong Su, Zhejiang Sci-Tech University
Jianming Dong, Zhejiang Sci-Tech UniversityFollow
Weitian Tong, Georgia Southern UniversityFollow
Randy Goebel, University of AlbertaFollow
Yinfeng Xu, Sichuan UniversityFollow
Guohui Lin, University of AlbertaFollow

Document Type

Contribution to Book

Publication Date

2015

Publication Title

Proceedings of the International Workshop on Frontiers of Algorithmics

DOI

10.1007/978-3-319-19647-3_10

ISBN

978-3-319-19647-3

ISSN

1611-3349

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.

Recommended Citation

Lu, Jueliang, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong, Randy Goebel, Yinfeng Xu, Guohui Lin. 2015. "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: 10.1007/978-3-319-19647-3_10 isbn: 978-3-319-19647-3
https://digitalcommons.georgiasouthern.edu/compsci-facpubs/70