A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty
DOI10.1007/S10479-011-0996-YzbMATH Open1233.90169OpenAlexW2151698172MaRDI QIDQ763115FDOQ763115
Authors: André Rossi, Alexis Aubry, Mireille Jacomino 
Publication date: 9 March 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0996-y
Recommendations
- A robustness measure of the configuration of multi-purpose machines
- Sensitivity analysis of the unrelated parallel machine scheduling problem with rework processes and machine eligibility restrictions
- Sensitivity analysis of a fuzzy multiobjective scheduling problem
- Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints
- Sensitivity bounds for machine scheduling with uncertain communication delays
Deterministic scheduling theory in operations research (90B35) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Robust discrete optimization and its applications
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Complexity of scheduling problems with multi-purpose machines
- A fast algorithm for building lattices
- Algorithms for robust single and multiple period layout planning for manufacturing systems
- Sensitivity analysis of scheduling algorithms
- Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint
Cited In (2)
This page was built for publication: A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763115)
