Flow Polyhedra and Resource Constrained Project Scheduling Problems

Flow Polyhedra and Resource Constrained Project Scheduling Problems

0.00 Avg rating0 Votes
Article ID: iaor201379
Volume: 46
Issue: 4
Start Page Number: 373
End Page Number: 409
Publication Date: Nov 2012
Journal: RAIRO - Operations Research
Authors: ,
Keywords: combinatorial optimization, heuristics: local search
Abstract:

This paper aims at describing the way Flow machinery may be used in order to deal with Resource Constrained Project Scheduling Problems (RCPSP). In order to do it, it first introduces the Timed Flow Polyhedron related to a RCPSP instance. Next it states several structural results related to connectivity and to cut management. It keeps on with a description of the way this framework gives rise to a generic Insertion operator, which enables programmers to design greedy and local search algorithms. It ends with numerical experiments.

Reviews

Required fields are marked *. Your email address will not be published.