Machine scheduling with a maintenance interval and job delivery coordination
Full Text: Hu2016_Article_MachineSchedulingWithAMaintena.pdf
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.
Citation
J. Hu, T. Luo, X. Su, J. Dong, W. Tong, R. Goebel, Y. Xu, G. Lin. "Machine scheduling with a maintenance interval and job delivery coordination". Optimization Letters, 10(8), pp 1645-1656, December 2016.| Keywords: | Scheduling, Machine maintenance, Job delivery, Bin-packing, Approximation algorithm, Worst-case performance analysis |
| Category: | In Journal |
| Web Links: | Springer |
| DOI |
BibTeX
@article{Hu+al:16,
author = {Jueliang Hu and Taibo Luo and Xiaotong Su and Jianming Dong and
Weitian Tong and Randy Goebel and Yinfeng Xu and Guohui Lin},
title = {Machine scheduling with a maintenance interval and job delivery
coordination},
Volume = "10",
Number = "8",
Pages = {1645-1656},
journal = {Optimization Letters},
year = 2016,
}Last Updated: February 13, 2020Submitted by Sabina P
