A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
From MaRDI portal
Publication:2643723
Recommendations
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Robust scheduling on a single machine to minimize total flow time
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty
- A robust approach for the single machine scheduling problem
- On the robust single machine scheduling problem
- A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints
- Distributionally robust single machine scheduling with the total tardiness criterion
- Robust scheduling in a just-in-time single machine system with processing time uncertainty
- Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations
- A family of inequalities valid for the robust single machine scheduling polyhedron
Cites work
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3786125 (Why is no real title available?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Provisioning virtual private networks under traffic uncertainty
- Restricted robust uniform matroid maximization under interval uncertainty
- Robust discrete optimization and its applications
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem
Cited in
(24)- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- 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
- Robust single machine scheduling with a flexible maintenance activity
- Distributionally robust single machine scheduling with risk aversion
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- Robust scheduling on a single machine to minimize total flow time
- Flow-based formulations for operational fixed interval scheduling problems with random delays
- 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
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Scheduling with uncertainties on new computing platforms
- Multi–stage process for chemotherapy scheduling and effective capacity determination
- Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks
- Minimizing total weighted completion time with uncertain data: a stability approach
- Min-max relative regret for scheduling to minimize maximum lateness
- Recoverable robust single machine scheduling with polyhedral uncertainty
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty
- Algorithms and complexity analysis for robust single-machine scheduling problems
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
This page was built for publication: A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643723)
