A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups
From MaRDI portal
Publication:5690253
DOI10.1057/jors.1996.152zbMath0871.90049OpenAlexW2031522948MaRDI QIDQ5690253
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
Lagrangean relaxationlower boundLagrangean decompositionoptimal makespanparallel, unrelated machineshybrid approximation procedurenonpreemptive single stage manufacturing process
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