A branch-price-and-cut algorithm for multi-mode resource leveling
From MaRDI portal
Publication:319528
DOI10.1016/j.ejor.2015.02.043zbMath1346.90335OpenAlexW2009877261MaRDI QIDQ319528
Marco E. Lübbecke, Jens Schulz, Eamonn T. Coughlan
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.02.043
integer programmingproject schedulingDantzig-Wolfe decompositionbranch-price-and-cutresource leveling
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (6)
Scheduling personnel for the build-up of unit load devices at an air cargo terminal with limited space ⋮ The multi-mode resource investment problem: a benchmark library and a computational study of lower and upper bounds ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem ⋮ A new cross decomposition method for stochastic mixed-integer linear programming ⋮ Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows
This page was built for publication: A branch-price-and-cut algorithm for multi-mode resource leveling
