Total completion time scheduling under scenarios
From MaRDI portal
Publication:6574934
DOI10.1007/978-3-031-49815-2_8MaRDI QIDQ6574934
Csanád Imreh, Martin Skutella, Thomas Bosman, Leen Stougie, Ekin Ergen, Martijn van Ee, Alberto Marchetti-Spaccamela
Publication date: 19 July 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- On the robust single machine scheduling problem
- Online makespan minimization with budgeted uncertainty
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Robust discrete optimization and its applications
- A priori TSP in the scenario model
- Single machine scheduling with scenarios
- Multicriteria global minimum cuts
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Introduction to Stochastic Programming
- Parallel Machine Scheduling under Uncertainty
- Dual Techniques for Scheduling on a Machine with Varying Speed
- Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
- Scheduling Unrelated Machines by Randomized Rounding
- $(2+\varepsilon)$-Sat Is NP-hard
- Some optimal inapproximability results
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- A Priori Optimization
- Approximation results for makespan minimization with budgeted uncertainty
- A state-of-the-art survey on multi-scenario scheduling
- SPT optimality (mostly) via linear programming
This page was built for publication: Total completion time scheduling under scenarios