论文信息 - An Effective Algorithm for Project Scheduling with Arbitrary Temporal Constraints

An Effective Algorithm for Project Scheduling with Arbitrary Temporal Constraints

The resource-constrained project scheduling problem with time windows (RCPSP/max) is an important generalization of a number of well studied scheduling problems. In this paper, we present a new heuristic algorithm that combines the benefits of squeaky wheel optimization with an effective conflict resolution mechanism, called bulldozing, to address RCPSP/max problems. On a range of benchmark problems, the algorithm is competitive with state-of-the-art systematic and non-systematic methods and scales well.

Tristan B. Smith | John M. Pyle

[1] Stephen F. Smith,et al. A Constraint-Based Method for Project Scheduling with Time Windows , 2002, J. Heuristics.

[2] Stephen F. Smith,et al. Boosting stochastic problem solvers through online self-analysis of performance , 2003 .

[3] Rina Dechter,et al. Temporal Constraint Networks , 1989, Artif. Intell..

[4] Rolf H. Möhring,et al. Resource constrained project scheduling with time windows: a branching scheme based on dynamic release dates (Technical Report 596-1998) , 1998 .

[5] Rolf H. Möhring,et al. Scheduling project networks with resource constraints and time windows , 1988 .

[6] Nicola Muscettola,et al. Computing the Envelope for Stepwise-Constant Resource Allocations , 2002, CP.

[7] Professor Dr. Klaus Neumann,et al. Project Scheduling with Time Windows and Scarce Resources , 2003, Springer Berlin Heidelberg.

[8] Matthew L. Ginsberg,et al. Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[9] David Joslin,et al. "Squeaky Wheel" Optimization , 1998, AAAI/IAAI.

[10] U. Dorndorf,et al. A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints , 2000 .

[11] Ping Chen,et al. The yard allocation problem , 2002, AAAI/IAAI.

[12] Philippe Laborie,et al. Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..