A branch-price-and-cut algorithm for multi-mode resource leveling

•We present a new model and algorithm for a RCPSP with availability constraints.•We propose a non-trivial, non-obvious Dantzig–Wolfe reformulation.•We translate standard precedence inequalities into our new formulation.•Our model gives significantly tighter lower bounds•We increase the size of insta...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 245; no. 1; pp. 70 - 80
Main Authors:	Coughlan, Eamonn T., Lübbecke, Marco E., Schulz, Jens
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16.08.2015 Elsevier Sequoia S.A
Subjects:	Algorithms Branch & bound algorithms Branch-price-and-cut Dantzig–Wolfe decomposition Integer programming Linear programming Mathematical models Project management Project scheduling Resource leveling Studies Integer programming Branch-price-and-cut Project scheduling Resource leveling Dantzig–Wolfe decomposition
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!