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.
Original language | English |
---|---|
Pages (from-to) | 1645-1656 |
Number of pages | 12 |
Journal | Optimization Letters |
Volume | 10 |
Issue number | 8 |
DOIs | |
State | Published - Dec 1 2016 |
Keywords
- Approximation algorithm
- Bin-packing
- Job delivery
- Machine maintenance
- Scheduling
- Worst-case performance analysis