Finding an optimal sequence by dynamic programming: an extension to precedence-related tasks
KR Baker, LE Schrage - Operations Research, 1978 - pubsonline.informs.org
KR Baker, LE Schrage
Operations Research, 1978•pubsonline.informs.orgWe 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.
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.
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.
INFORMSShowing the best result for this search. See all results