Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times
From MaRDI portal
Publication:2288971
DOI10.1007/s10479-019-03263-6zbMath1434.90113OpenAlexW2944472270WikidataQ127889529 ScholiaQ127889529MaRDI QIDQ2288971
Publication date: 20 January 2020
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-019-03263-6
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Robustness in mathematical programming (90C17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pinpointing the complexity of the interval min-max regret knapsack problem
- On scheduling around large restrictive common due windows
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Minimizing total weighted flow time of a set of jobs with interval processing times
- Minmax scheduling problems with a common due-window
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robust discrete optimization and its applications
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- Project scheduling under uncertainty: survey and research potentials
- Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- An overview of bilevel optimization
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- Stochastic Scheduling with Release Dates and Due Dates
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Reducibility among Combinatorial Problems
- On the complexity of a class of combinatorial optimization problems with uncertainty
