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(n^{4})\)-time algorithms.
This is a preview of subscription content, log in via an institution to check access.
References
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discret. Math. 5, 287–326 (1979)
Van Wassenhove, L.N., Gelders, F.: Solving a bicriterion scheduling problem. Eur. J. Oper. Res. 4, 42–48 (1980)
John, T.C.: Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty. Comput. Oper. Res. 16, 471–479 (1989)
Hoogeveen, J.A., van de Velde, S.L.: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Oper. Res. Lett. 17, 205–208 (1995)
Gao, Y., Yuan, J.J.: A note on Pareto minimizing total completion time and maximum cost. Oper. Res. Lett. 43, 80–82 (2014). doi:10.1016/j.orl.2014.12.001
Lawler, E.L.: Optimal sequencing of a single machine subject to precedence constraints. Manag. Sci. 19, 544–546 (1973)
Hoogeveen, H.: Multicriteria scheduling. Eur. J. Oper. Res. 167, 592–623 (2005)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported by the National Natural Science Foundation of China (Nos.11271338, 11171313 and 11301528) and the Natural Science Foundation of Henan Province of China (No. 142300410437).
Rights and permissions
About this article
Cite this article
Gao, Y., Yuan, JJ. Pareto Minimizing Total Completion Time and Maximum Cost with Positional Due Indices. J. Oper. Res. Soc. China 3, 381–387 (2015). https://doi.org/10.1007/s40305-015-0083-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40305-015-0083-1