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

DOI10.1057/JORS.1996.152zbMATH Open0871.90049OpenAlexW2031522948MaRDI QIDQ5690253FDOQ5690253

Authors: Hochang Lee, Monique Guignard 

Publication date: 15 January 1997

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

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

Recommendations

• On modelling the maximum workload allocation for parallel unrelated machines with setups
• Exact and approximation algorithms for makespan minimization on unrelated parallel machines
• Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times

zbMATH Keywords

lower boundLagrangean relaxationLagrangean decompositionoptimal makespanparallel, unrelated machineshybrid approximation procedurenonpreemptive single stage manufacturing process

Mathematics Subject Classification ID

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

Cited In (5)

• An homage to Joseph-Louis Lagrange and Pierre Huard
• On modelling the maximum workload allocation for parallel unrelated machines with setups
• Heuristic methods for the identical parallel machine flowtime problem with set-up times
• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
• Lagrangean relaxation. (With comments and rejoinder).

This page was built for publication: A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5690253)