An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems

DOI10.1016/j.ejor.2019.06.007zbMath1430.90227OpenAlexW2950584441WikidataQ127708057 ScholiaQ127708057MaRDI QIDQ2312337

Guillaume Lepelletier, Quentin Christ, Stéphane Dauzère-Pérès

Publication date: 5 July 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.06.007

zbMATH Keywords

linear programmingmanufacturingdualityworkload balancingmin-max fairness

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (1)

Optimizing multiple qualifications of products on non-identical parallel machines

Cites Work

• Unnamed Item
• Basin-wide cooperative water resources allocation
• Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
• Resource allocation among competing activities: A lexicographic minimax approach
• A simplex based algorithm for the lexicographically extended linear maxmin problem
• Home health care routing and scheduling: a review
• Fair optimization and networks: a survey
• Lexicographically Minimum and Maximum Load Linear Programming Problems
• A Max-Min Allocation Problem: Its Solutions and Applications
• On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach

This page was built for publication: An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems