Minimizing worst-case and average-case makespan over scenarios
DOI10.1007/s10951-016-0484-yzbMath1386.90052OpenAlexW2424274037MaRDI QIDQ1702655
Frans Schalekamp, Anke van Zuylen, Leen Stougie, Alberto Marchetti-Spaccamela, Esteban Feuerstein, R. A. Sitters, Suzanne Van der Ster
Publication date: 28 February 2018
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://scholarworks.wm.edu/cgi/viewcontent.cgi?article=1112&context=aspubs
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Robust optimization-methodology and applications
- Improved approximations for max set splitting and max NAE SAT
- Approximating the min-max (regret) selecting items problem
- Network design with a discrete set of traffic matrices
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Outward rotations
- Universal Sequencing on an Unreliable Machine
- Introduction to Stochastic Programming
- Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
- Parallel Machine Scheduling under Uncertainty
- On the power of unique 2-prover 1-round games
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On Multidimensional Packing Problems
- $(2+\varepsilon)$-Sat Is NP-hard
- Some optimal inapproximability results
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Scheduling
This page was built for publication: Minimizing worst-case and average-case makespan over scenarios
