A robustness measure of the configuration of multi-purpose machines

DOI10.1080/00207540802473997zbMath1197.90227OpenAlexW2017902940MaRDI QIDQ3163727

André Rossi

Publication date: 26 October 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540802473997

zbMATH Keywords

schedulingproduction planningcombinatorial optimisation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (3)

Stochastic programming for qualification management of parallel machines in semiconductor manufacturing ⋮ Towards a Robust Scheduling on Unrelated Parallel Machines: A Scenarios Based Approach ⋮ Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints

Cites Work

• A new polynomial-time algorithm for linear programming
• On the calculation of the stability radius of an optimal or an approximate schedule
• 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
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: A robustness measure of the configuration of multi-purpose machines