A note on Pareto minimizing total completion time and maximum cost

作者：Gao Yuan; Yuan Jinjiang^*

来源：Operations Research Letters, 2015, 43(1): 80-82.

DOI：10.1016/j.orl.2014.12.001

• Scheduling
• Pareto optimization
• Maximum cost
• Complexity analysis

For computing all Pareto-optimal schedules on a single machine to minimize the total completion time and a maximum cost, Hoogeveen and van de Velde (1995) presented an O(n(3) log Sigma p(j))-time algorithm. However, the complexity analysis of their algorithm is invalid. We here present a new algorithm and show that it achieves the computation time O(n(3) log Sigma p(j)).

• 出版日期2015-1
• 单位郑州大学