Welcome to the InfoSci Platform
Reference Hub2
Finding the Shortest Non-Delay Schedule for a Resource-Constrained Project

Finding the Shortest Non-Delay Schedule for a Resource-Constrained Project

Yuval Cohen, Arik Sadeh, Ofer Zwikael
Copyright: © 2012 |Volume: 3 |Issue: 4 |Pages: 18
ISSN: 1947-9328|EISSN: 1947-9336|EISBN13: 9781466613843|DOI: 10.4018/joris.2012100103
Cite Article Cite Article

MLA

Cohen, Yuval, et al. "Finding the Shortest Non-Delay Schedule for a Resource-Constrained Project." IJORIS vol.3, no.4 2012: pp.41-58. http://doi.org/10.4018/joris.2012100103

APA

Cohen, Y., Sadeh, A., & Zwikael, O. (2012). Finding the Shortest Non-Delay Schedule for a Resource-Constrained Project. International Journal of Operations Research and Information Systems (IJORIS), 3(4), 41-58. http://doi.org/10.4018/joris.2012100103

Chicago

Cohen, Yuval, Arik Sadeh, and Ofer Zwikael. "Finding the Shortest Non-Delay Schedule for a Resource-Constrained Project," International Journal of Operations Research and Information Systems (IJORIS) 3, no.4: 41-58. http://doi.org/10.4018/joris.2012100103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Non-delay schedules lack non-essential idle time intervals. Many heuristics for solving the resource-constrained project scheduling problem yield non-delay schedules. This paper presents a technique for finding the shortest non-delay schedule, which should be as good as the heuristics for this purpose. The authors combine branch-and-bound and dynamic programming approaches to yield a surprisingly simple algorithm. (The simplicity is reflected in the number of calculations and memory required.) Due to its simplicity, a project manager should be able to trace the algorithm’s stages and results without difficulty. This simplicity is a result of: (1) the number of stages equals the number of activities; (2) each stage uses only information from the previous stage, and the number of different schedules is typically limited; and (3) the proposed method becomes simpler the more it is constrained. A detailed example illustrates the technique, which is validated by comparisons to models from the literature.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.