On modelling the maximum workload allocation for parallel unrelated machines with setups

From MaRDI portal

Publication:1309883

Jump to:navigation, search

zbMath0783.90049MaRDI QIDQ1309883

Brenda L. Dietrich, Laureano Fernando Escudero Bueno

Publication date: 6 January 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound makespan covers lower bounds Lagrangian decomposition cutting planes cliques manufacturing process equivalent 0-1 models feasible allocation of parts

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Boolean programming (90C09)

Related Items (3)

Some of my favorite integer programming applications at IBM ⋮ An homage to Joseph-Louis Lagrange and Pierre Huard ⋮ A new approximation algorithm for unrelated parallel machine scheduling with release dates

This page was built for publication: On modelling the maximum workload allocation for parallel unrelated machines with setups

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1309883&oldid=13425703"