An effective algorithm for project scheduling with arbitrary temporal constraints

Authors:
Tristan B. Smith;John M. Pyle
Affiliations:
CIS Department, University of Oregon, Eugene, OR;On Time Systems, Inc., Eugene, OR
Venue:
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Year:
2004

Citing 9
Cited 7

Scheduling project networks with resource constraints and time windows

Annals of Operations Research
Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
A Constraint-Based Method for Project Scheduling with Time Windows

Journal of Heuristics
Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results

Artificial Intelligence
Computing the Envelope for Stepwise-Constant Resource Allocations

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
The yard allocation problem

Eighteenth national conference on Artificial intelligence
A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints

Management Science
Boosting stochastic problem solvers through online self-analysis of performance

Boosting stochastic problem solvers through online self-analysis of performance
"Squeaky Wheel" optimization

Journal of Artificial Intelligence Research

Combining genetic algorithms with squeaky-wheel optimization

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Improving genetic algorithm performance with intelligent mappings from chromosomes to solutions

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Simulation-based planning for planetary rover experiments

WSC '05 Proceedings of the 37th conference on Winter simulation
The max K-armed bandit: a new model of exploration applied to search heuristic selection

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Schedule robustness through broader solve and robustify search for partial order schedules

AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Mixed discrete and continuous algorithms for scheduling airborne astronomy observations

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Solving RCPSP/max by lazy clause generation

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.