A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
From MaRDI portal
Publication:2448222
DOI10.1007/s11590-013-0655-0zbMath1293.90024OpenAlexW2074479192MaRDI QIDQ2448222
Publication date: 30 April 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-013-0655-0
Related Items
The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective ⋮ Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion ⋮ Robust single machine scheduling with a flexible maintenance activity ⋮ Distributionally robust scheduling on parallel machines under moment uncertainty ⋮ Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion ⋮ An adaptive robust optimization model for parallel machine scheduling
Uses Software
Cites Work
- Unnamed Item
- Robust multi-market newsvendor models with interval demand data
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- Scheduling with uncertainties on new computing platforms
- Exact and heuristic algorithms for the interval data robust assignment problem
- On the robust single machine scheduling problem
- Complexity of the min-max and min-max regret assignment problems
- Discrete optimization with interval data. Minmax regret and fuzzy approach
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- Minimizing total weighted flow time of a set of jobs with interval processing times
- A decomposition scheme for single stage scheduling problems
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robust discrete optimization and its applications
- Optimal makespan scheduling with given bounds of processing times
- Robust scheduling on a single machine to minimize total flow time
- Project scheduling under uncertainty: survey and research potentials
- Strategic facility location: A review
- Executing production schedules in the face of uncertainties: a review and some future directions
- Mean flow time minimization with given bounds of processing times
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- Transmission Network Expansion Planning Under Deliberate Outages
- Sequencing with uncertain numerical data for makespan minimisation
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Technical Note—Minimizing Average Flow Time with Parallel Machines
This page was built for publication: A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
