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

MaRDI QIDQ1309883zbMATH OpenFDO

Authors Brenda L. Dietrich, Laureano F. Escudero Bueno

Publication date 6 January 1994

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

zbMATH Keywords

branch-and-boundcliquescoverscutting planesequivalent 0-1 modelsfeasible allocation of partsLagrangian decompositionlower boundsmakespanmanufacturing process

Mathematics Subject Classification ID

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

Recommendations

• A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups
• Lot-size scheduling of a single product on unrelated parallel machines
• Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
• Heuristic scheduling of parallel machines with sequence-dependent set-up times
• Parallel machine scheduling by family batching with sequence-independent set-up times

Cited in

(8)

• A new approximation algorithm for unrelated parallel machine scheduling with release dates
• An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems
• Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint
• Some of my favorite integer programming applications at IBM
• An homage to Joseph-Louis Lagrange and Pierre Huard
• Scheduling of unrelated parallel manufacturing cells with limited human resources
• A desired load distribution model for scheduling of unrelated parallel machines
• A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups

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

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