Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times
DOI10.1016/j.cor.2018.05.025zbMath1391.90438OpenAlexW2807063538MaRDI QIDQ1651660
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.05.025
decomposition algorithmdistributional robustnessfixed interval schedulingcardinality constrained ambiguity setstochastic job durations
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Stochastic programming (90C15) Stochastic scheduling theory in operations research (90B36)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Tactical fixed job scheduling with spread-time constraints
- Optimal interval scheduling with a resource constraint
- Interval scheduling maximizing minimum coverage
- On the complexity of interval scheduling with a resource constraint
- Multivariate Archimedean copulas, \(d\)-monotone functions and \(\ell _{1}\)-norm symmetric distributions
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Scheduling jobs with fixed start and end times
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- Robust discrete optimization and network flows
- Distributionally robust single machine scheduling with risk aversion
- Flow-based formulations for operational fixed interval scheduling problems with random delays
- Multi-resource allocation in stochastic project scheduling
- Distributionally robust joint chance constraints with second-order moment information
- A distributionally robust perspective on uncertainty quantification and chance constrained programming
- Minimizing shifts for personnel task scheduling problems: a three-phase algorithm
- Interval scheduling on identical machines
- Estimating Archimedean Copulas in High Dimensions
- Interval scheduling: A survey
- The Price of Robustness
- Lectures on Stochastic Programming
- An Optimal Solution for the Channel-Assignment Problem
- Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
- Nonlinear Programming
This page was built for publication: Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times