A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups

DOI10.1057/jors.1996.152zbMath0871.90049OpenAlexW2031522948MaRDI QIDQ5690253

Hochang Lee, Monique Guignard

Publication date: 15 January 1997

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

Full work available at URL: https://doi.org/10.1057/jors.1996.152

zbMATH Keywords

Lagrangean relaxationlower boundLagrangean decompositionoptimal makespanparallel, unrelated machineshybrid approximation procedurenonpreemptive single stage manufacturing process

Mathematics Subject Classification ID

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

Related Items

Lagrangean relaxation. (With comments and rejoinder). ⋮ An homage to Joseph-Louis Lagrange and Pierre Huard ⋮ Heuristic methods for the identical parallel machine flowtime problem with set-up times