A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty

DOI10.1007/s10479-011-0996-yzbMath1233.90169OpenAlexW2151698172MaRDI QIDQ763115

André Rossi, Mireille Jacomino, Alexis Aubry

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

zbMATH Keywords

linear programmingsensitivity analysisconfigurationdemand uncertaintymulti-purpose machines

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Deterministic scheduling theory in operations research (90B35)

Cites Work

• A polynomial-time algorithm, based on Newton's method, for linear programming
• Algorithms for robust single and multiple period layout planning for manufacturing systems
• Robust discrete optimization and its applications
• Complexity of scheduling problems with multi-purpose machines
• A fast algorithm for building lattices
• Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Sensitivity analysis of scheduling algorithms
• Unnamed Item

This page was built for publication: A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty