Pareto Minimizing Total Completion Time and Maximum Cost with Positional Due Indices
In this paper, we study the Pareto optimization scheduling problem on a single machine with positional due indices of jobs to minimize the total completion time and a maximum cost. For this problem, we give two O(n4)-time algorithms.
Yuan Gao · Jin-Jiang Yuan . Pareto Minimizing Total Completion Time and Maximum Cost with Positional Due Indices[J]. Journal of the Operations Research Society of China, 2015 , 3(3) : 381 . DOI: 10.1007/s40305-015-0083-1
/
| 〈 |
|
〉 |
