Lawler's minmax cost algorithm: optimality conditions and uncertainty

DOI10.1007/s10951-014-0413-xzbMath1347.90034OpenAlexW2017972746MaRDI QIDQ309059

Nadia Brauner, Dzmitry Sledneu, Gerd Finke, Yakov M. Shafransky

Publication date: 7 September 2016

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-014-0413-x

zbMATH Keywords

uncertaintymaximum regretLawler's minmax cost algorithm

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Lawler's minmax cost problem under uncertainty ⋮ Minimizing maximum cost for a single machine under uncertainty of processing times ⋮ Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices ⋮ Risk-averse single machine scheduling: complexity and approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing the number of late jobs on a single machine under due date uncertainty
• Necessary and sufficient conditions of optimality for some classical scheduling problems
• Complexity of single machine scheduling problems under scenario-based uncertainty
• Robust discrete optimization and its applications
• Minmax regret solutions for minimax optimization problems with uncertainty
• Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
• Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: Lawler's minmax cost algorithm: optimality conditions and uncertainty