Scheduling with uncertainties on new computing platforms
From MaRDI portal
Publication:535305
DOI10.1007/s10589-009-9311-0zbMath1219.90066OpenAlexW2007590957MaRDI QIDQ535305
Amine Mahjoub, Denis Trystram, Johnatan E. Pecero Sánchez
Publication date: 11 May 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9311-0
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random orders
- UET scheduling with unit interprocessor communication delays
- NP-complete scheduling problems
- Dynamic scheduling on parallel machines
- Robust discrete optimization and its applications
- On the robust shortest path problem.
- Project scheduling under uncertainty: survey and research potentials
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- Towards an Architecture-Independent Analysis of Parallel Algorithms
- Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
- Scheduling Precedence Task Graphs with Disturbances
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- A Priori Optimization
- Sensitivity analysis for scheduling problems
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Sensitivity analysis of scheduling algorithms
This page was built for publication: Scheduling with uncertainties on new computing platforms
