Total completion time scheduling under scenarios
From MaRDI portal
Publication:6574934
Cites work
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 6469210 (Why is no real title available?)
- A Priori Optimization
- A priori TSP in the scenario model
- A state-of-the-art survey on multi-scenario scheduling
- Approximation and randomization in scheduling
- Approximation results for makespan minimization with budgeted uncertainty
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Dual techniques for scheduling on a machine with varying speed
- Introduction to stochastic programming.
- Multicriteria global minimum cuts
- On the robust single machine scheduling problem
- Online makespan minimization with budgeted uncertainty
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Parallel machine scheduling under uncertainty
- Robust discrete optimization and its applications
- Robust optimization
- SPT optimality (mostly) via linear programming
- Scheduling Unrelated Machines by Randomized Rounding
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Single machine scheduling with scenarios
- Some optimal inapproximability results
- The sample average approximation method for stochastic discrete optimization
- Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
- When the optimum is also blind: a new perspective on universal optimization
- \((2+\varepsilon)\)-Sat is NP-hard
This page was built for publication: Total completion time scheduling under scenarios
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574934)
