论文信息 - Solving the resource-constraint project scheduling problem by integrating exact resolution and local search

Solving the resource-constraint project scheduling problem by integrating exact resolution and local search

We present a new heuristic for solving the resource-constrained project scheduling problem. The method is based on the iterative generation of subproblems, each one being solved by an exact method of a standard commercial tool. The good computational results on standard benchmark instances enlighten the practical interest of the approach.

Christian Artigues | Philippe Michelon | Mireille Palpant

[1] Egon Balas,et al. The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[2] Sönke Hartmann,et al. A self‐adapting genetic algorithm for project scheduling under resource constraints , 2002 .

[3] Paul Shaw,et al. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[4] Rainer Kolisch,et al. Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem , 2000, Eur. J. Oper. Res..

[5] Rainer Kolisch,et al. Benchmark instances for project scheduling problems , 1999 .

[6] Rolf H. Möhring,et al. Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[7] Rolf H. Möhring,et al. Solving Project Scheduling Problems by Minimum Cut Computations , 2002, Manag. Sci..

[8] Arno Sprecher,et al. Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements , 2000 .

[9] François Laburthe,et al. Combining local and global search in a constraint programming environment , 2001, The Knowledge Engineering Review.