Name
Title | ||
|---|---|---|
Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time. |
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. ? 2012 Springer-Verlag. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s11590-012-0472-x | Optimization Letters |
Keywords | Field | DocType |
maintenance activity,scheduling,total completion time,unrelated parallel-machine | Mathematical optimization,Machine scheduling,Scheduling (computing),Mathematics | Journal |
Volume | Issue | ISSN |
8 | 1 | 18624480 |
Citations | PageRank | References |
6 | 0.47 | 27 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Li-Yan Wang | 1 | 6 | 0.47 |
| Xue Huang | 2 | 31 | 2.32 |
| Ping Ji | 3 | 296 | 18.86 |
| En-Min Feng | 4 | 8 | 1.87 |