Lawler's minmax cost algorithm: optimality conditions and uncertainty

DOI10.1007/S10951-014-0413-XMaRDI QIDQ309059zbMATHOpenAlexFDO

Authors Nadia Brauner, Gerd Finke, Dzmitry Sledneu, Y. 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

uncertaintyLawler's minmax cost algorithmmaximum regret

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)

Recommendations

• Lawler's minmax cost problem under uncertainty
• Minimizing maximum cost for a single machine under uncertainty of processing times
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
• scientific article; zbMATH DE number 4033468
• An algorithm for single machine sequencing with release dates to minimize maximum cost

Cites work

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

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309059)