Optimizing multiple qualifications of products on non-identical parallel machines

DOI10.1016/j.cor.2022.105813OpenAlexW4224044775WikidataQ114193078 ScholiaQ114193078MaRDI QIDQ2147099

Stéphane Dauzère-Pérès, Antoine Perraudat, Philippe Vialletelle

Publication date: 22 June 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.105813

zbMATH Keywords

optimizationheuristicsflexible manufacturing systemsqualification managementnon-identical parallel machines

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling job families on non-identical parallel machines with time constraints
• A probabilistic heuristic for a computationally difficult set covering problem
• Stochastic programming for qualification management of parallel machines in semiconductor manufacturing
• A batch-oblivious approach for complex job-shop scheduling problems
• Bi-objective parallel machine scheduling with additional resources during setups
• An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems
• Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint

This page was built for publication: Optimizing multiple qualifications of products on non-identical parallel machines