A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
From MaRDI portal
Publication:2643723
DOI10.1007/s10852-006-9044-3zbMath1152.90455OpenAlexW2059439429MaRDI QIDQ2643723
Publication date: 27 August 2007
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-006-9044-3
Mixed integer programming (90C11) Minimax problems in mathematical programming (90C47) Deterministic scheduling theory in operations research (90B35)
Related Items
Investigating the recoverable robust single machine scheduling problem under interval uncertainty, Distributionally robust single machine scheduling with the total tardiness criterion, Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios, Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty, The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective, Minimizing total weighted completion time with uncertain data: a stability approach, Multi–stage process for chemotherapy scheduling and effective capacity determination, Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks, Algorithms and complexity analysis for robust single-machine scheduling problems, Approximating a two-machine flow shop scheduling under discrete scenario uncertainty, A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines, 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, A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion, 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, Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty, Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times, Min-max and min-max regret versions of combinatorial optimization problems: A survey
Cites Work
- Unnamed Item
- Unnamed Item
- Restricted robust uniform matroid maximization under interval uncertainty
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Robust discrete optimization and its applications
- Provisioning virtual private networks under traffic uncertainty
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem
