Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks

Kenneth R. Baker and Linus E. Schrage
Additional contact information
Kenneth R. Baker: Duke University, Durham, North Carolina
Linus E. Schrage: University of Chicago, Chicago, Illinois

Operations Research, 1978, vol. 26, issue 1, 111-120

Abstract: We discuss the dynamic programming approach to finding an optimal sequence of a set of tasks when the tasks are related by precedence restrictions. We describe how to use this approach in problems where no explicit precedence relations exist. Computer implementation considerations played an important role in its development. Computational results indicate that, when the curse of dimensionality can be dispelled, dynamic programming can be a useful procedure for large sequencing problems.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.1.111 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:26:y:1978:i:1:p:111-120

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().