Lawler's minmax cost algorithm: optimality conditions and uncertainty

DOI10.1007/S10951-014-0413-XzbMATH Open1347.90034OpenAlexW2017972746MaRDI QIDQ309059FDOQ309059

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

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

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)

Cites Work

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

Cited In (4)

• 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
• Lawler's minmax cost problem under uncertainty

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)