An Effective Algorithm for Project Scheduling with Arbitrary Temporal Constraints
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.
Cite
Text
Smith and Pyle. "An Effective Algorithm for Project Scheduling with Arbitrary Temporal Constraints." AAAI Conference on Artificial Intelligence, 2004.Markdown
[Smith and Pyle. "An Effective Algorithm for Project Scheduling with Arbitrary Temporal Constraints." AAAI Conference on Artificial Intelligence, 2004.](https://mlanthology.org/aaai/2004/smith2004aaai-effective/)BibTeX
@inproceedings{smith2004aaai-effective,
title = {{An Effective Algorithm for Project Scheduling with Arbitrary Temporal Constraints}},
author = {Smith, Tristan B. and Pyle, John M.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2004},
pages = {544-549},
url = {https://mlanthology.org/aaai/2004/smith2004aaai-effective/}
}