Single machine scheduling with scenarios
From MaRDI portal
Publication:1945942
DOI10.1016/j.tcs.2012.12.006zbMath1261.68170OpenAlexW2026900294MaRDI QIDQ1945942
Ola Svensson, Monaldo Mastrolilli, Nikolaus Mutsanas
Publication date: 17 April 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.006
Stochastic programming (90C15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (13)
Single machine scheduling problems with uncertain parameters and the OWA criterion ⋮ Investigating the recoverable robust single machine scheduling problem under interval uncertainty ⋮ Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ Parameterized multi-scenario single-machine scheduling problems ⋮ Complexity of the robust weighted independent set problems on interval graphs ⋮ Risk Averse Scheduling with Scenarios ⋮ Approximability of the robust representatives selection problem ⋮ An approximation scheme for the bi-scenario sum of completion times trade-off problem ⋮ Risk-averse single machine scheduling: complexity and approximation ⋮ Approximation results for makespan minimization with budgeted uncertainty ⋮ Scheduling in multi-scenario environment with an agreeable condition on job processing times ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
This page was built for publication: Single machine scheduling with scenarios
