Abstract
The well-known \(O(n^2)\) minmax cost algorithm of Lawler (Manag Sci 19(5):544–546, 1973) was developed to minimize the maximum cost of jobs processed by a single machine under precedence constraints. We first develop a fast updating algorithm to obtain optimal solutions for two neighboring instances. This method will be used throughout this article. Then we consider job cost functions that depend on the completion time and on one or more additional numerical parameters. The parameters are uncertain and take values from given intervals. Under the uncertainty, we apply the minmax regret criterion for choosing a solution. We generalize results by Brauner et al. (J Sched, 2015) for decomposable cost functions with deterministic processing times and a single uncertain parameter to general cost functions. We describe different conditions, under which minmax regret solutions can be obtained with the time complexity \(O(n^3)\) or \(O(n^2)\). Then the updating algorithm is applied to the lateness model by Kasperski (Oper Res Lett 33:431–436, 2005) where both the processing time and the due date of each job are uncertain. The original \(O(n^4)\) running time is improved to the time complexity \(O(n^3)\). Finally, we extend the cost functions with a single uncertain parameter to those with a vector of additional uncertain parameters, improve one of the complexity results by Volgenant and Duin (Comput Oper Res 37:909–915, 2010) and solve some new problems.
Similar content being viewed by others
References
Aissi H, Aloulou MA, Kovalyov MY (2011) Minimizing the number of late jobs on a single machine under due date uncertainty. J Sched 14:351–360
Aissi H, Bazgan C, Vanderpooten D (2009) Minmax and minmax regret versions of combinatorial optimization problems: a survey. Eur J Oper Res 197:427–438
Aloulou MA, Della Croce F (2008) Complexity of single machine scheduling problems under scenario-based uncertainty. Oper Res Lett 36:338–342
Averbakh I (2000) Minmax regret solutions for minimax optimization problems with uncertainty. Oper Res Lett 27:57–65
Brauner N, Finke G, Shafransky Y, Sledneu D (2015) Lawler’s minmax cost algorithm: optimality conditions and uncertainty. J Sched. doi:10.1007/s10951-014-0413-x
Hochbaum DS, Shamir R (1989) An \(O(n \log ^2 n)\) algorithm for the maximum weighted tardiness problem. Inf Proces Lett 31:215–219
Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer Academic Publishers, Dordrecht
Kasperski A (2005) Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion. Oper Res Lett 33:431–436
Lawler EL (1973) Optimal sequencing of a single machine subject to precedence constraints. Manag Sci 19(5):544–546
Moore JM (1968) A \(n\) job, one machine scheduling algorithm for minimizing the number of late jobs. Manag Sci 15:102–109
Rosenhead J, Elton M, Gupta SK (1972) Robustness and optimality as criteria for strategic decisions. Oper Res Q 23(4):413–431
Savage LJ (1954) The foundations of statistics. Wiley, New York
Volgenant A, Duin CW (2010) Improved polynomial algorithms for robust bottleneck problems with interval data. Comput Oper Res 37:909–915
Wald A (1950) Statistical decision functions. Wiley, New York
Acknowledgments
The research of the third author have been partially supported by the BRFFR project \({\varPhi }15\)CO-043. We are grateful to referees for their substantial and helpful comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Brauner, N., Finke, G. & Shafransky, Y. Lawler’s minmax cost problem under uncertainty. J Comb Optim 34, 31–46 (2017). https://doi.org/10.1007/s10878-016-0051-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-016-0051-7