A rough-cut capacity planning model with overlapping

DOI10.1007/s00291-016-0436-0zbMath1339.90017OpenAlexW2284538595MaRDI QIDQ280165

Alain Haït, Guillaume Bouvignies, Georges Baydoun, Bernard Clément, Robert Pellerin

Publication date: 4 May 2016

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-016-0436-0

zbMATH Keywords

overlappingconcurrent engineeringrough-cut capacity planning

Mathematics Subject Classification ID

Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)

Related Items (4)

Editorial ``Project management and scheduling ⋮ Benders decomposition for a period-aggregated resource leveling problem with variable job duration ⋮ An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem

Cites Work

• MIP models for resource-constrained project scheduling with flexible resource profiles
• A cutting plane approach for integrated planning and scheduling
• A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
• Unnamed Item

This page was built for publication: A rough-cut capacity planning model with overlapping