Abstract
Wang et al. (J Operat Res Soc 62: 1898-1902, 2011) studied the m identical parallel-machine and unrelated parallel-machine scheduling with a deteriorating maintenance activity to minimize the total completion time. They showed that each problem can be solved in O(n2m+3) time, where n is the number of jobs. In this note, we discuss the unrelated parallel-machine setting and show that the problem can be optimally solved by a lower order algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 129-134 |
| Number of pages | 6 |
| Journal | Optimization Letters |
| Volume | 8 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jan 2014 |
Keywords
- Maintenance activity
- Scheduling
- Total completion time
- Unrelated parallel-machine
ASJC Scopus subject areas
- Control and Optimization