Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
From MaRDI portal
Publication:2488241
DOI10.1016/j.orl.2004.07.004zbMath1090.90136OpenAlexW2074424584MaRDI QIDQ2488241
Publication date: 25 August 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2004.07.004
Related Items (22)
Single machine scheduling problems with uncertain parameters and the OWA criterion ⋮ Distributionally robust single machine scheduling with the total tardiness criterion ⋮ Lawler's minmax cost algorithm: optimality conditions and uncertainty ⋮ Scheduling under linear constraints ⋮ Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty ⋮ Measures of problem uncertainty for scheduling with interval processing times ⋮ Lawler's minmax cost problem under uncertainty ⋮ Minimizing maximum cost for a single machine under uncertainty of processing times ⋮ Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems ⋮ Min-max relative regret for scheduling to minimize maximum lateness ⋮ Algorithms and complexity analysis for robust single-machine scheduling problems ⋮ Approximating a two-machine flow shop scheduling under discrete scenario uncertainty ⋮ Complexity of single machine scheduling problems under scenario-based uncertainty ⋮ Minimizing value-at-risk in single-machine scheduling ⋮ Distributionally robust single machine scheduling with risk aversion ⋮ Scheduling with uncertainties on new computing platforms ⋮ Minimizing total weighted flow time under uncertainty using dominance and a stability box ⋮ Robust scheduling on a single machine to minimize total flow time ⋮ Minimizing total weighted flow time of a set of jobs with interval processing times ⋮ Risk-averse single machine scheduling: complexity and approximation ⋮ Min-max and min-max regret versions of combinatorial optimization problems: A survey ⋮ Improved polynomial algorithms for robust bottleneck problems with interval data
Cites Work
- Robust discrete optimization and its applications
- Minmax regret solutions for minimax optimization problems with uncertainty
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Unnamed Item
- Unnamed Item
This page was built for publication: Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
