On a Paper by Christofides Et Al. For Solving the Multiple-Resource Constrained, Single Project Scheduling Problem
In a recently published article in EJOR, Christofides et al. (CAT) present a depth-first search, branch-and-bound solution procedure for the multiple-resource constrained, single project scheduling problem. While there are many important contributions in this paper, we show by counterexample that if...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
1994
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/2226 https://doi.org/10.1016/0377-2217(94)90018-3 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |
| Summary: | In a recently published article in EJOR, Christofides et al. (CAT) present a depth-first search, branch-and-bound solution procedure for the multiple-resource constrained, single project scheduling problem. While there are many important contributions in this paper, we show by counterexample that if the branching strategy described by the authors is used, the optimal solution might not result. Computational experience on a set of test problems appearing in the open literature is reported both with the original branching strategy suggested by the authors and a modified branching strategy that we propose. The modified strategy guarantees the determination of the optimal solution in all instances of the problem at the expense of an increase in node evaluations and average CPU time. Computational results using the revised procedure and a hybrid, breadth-first search procedure also investigated by CAT are reported. |
|---|