A fast approach to computing exact solutions to the Resource-Constrained Scheduling problem
Document Type
Article
Publication Date
1-1-2001
Abstract
This article presents an algorithm that substantially reduces the computational effort required to obtain the exact solution to the Resource Constrained Scheduling (RCS) problem. The reduction is obtained by (a) using a branch-and-bound search technique, which computes both upper and lower bounds, and (b) using efficient techniques to accurately estimate the possible time-steps at which each operation can be scheduled and using this to prune the search space. Results on several benchmarks with varying resource constraints indicate the clear superiority of the algorithm presented here over traditional approaches using integer linear programming, with speed-ups of several orders of magnitude. © 2001 ACM.
Publication Source (Journal or Book title)
ACM Transactions on Design Automation of Electronic Systems
First Page
490
Last Page
500
Recommended Citation
Narasimhan, M., & Ramanujam, J. (2001). A fast approach to computing exact solutions to the Resource-Constrained Scheduling problem. ACM Transactions on Design Automation of Electronic Systems, 6 (4), 490-500. https://doi.org/10.1145/502175.502178