Journal of the Operations Research Society of China
• Discrete Optimization • Previous Articles
Online:
Published:
Abstract:
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.
Key words: Scheduling ·, Pareto optimization ·, Maximum cost ·Positional due indices
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, doi: 10.1007/s40305-015-0083-1.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jorsc.shu.edu.cn/EN/10.1007/s40305-015-0083-1
https://www.jorsc.shu.edu.cn/EN/Y2015/V3/I3/381
