Machine Scheduling With a Maintenance Interval and Job Delivery Coordination

Authors

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

Document Type

Article

Publication Date

12-2016

Publication Title

Optimization Letters

DOI

10.1007/s11590-015-0939-7

ISSN

1862-4480

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

Recommended Citation

Hu, Jueliang, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong, Randy Goebel, Yinfeng Xu, Guohui Lin. 2016. "Machine Scheduling With a Maintenance Interval and Job Delivery Coordination." Optimization Letters, 10 (8): 1645-1656. doi: 10.1007/s11590-015-0939-7
https://digitalcommons.georgiasouthern.edu/compsci-facpubs/61

Copyright

This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.