FINDING AN OPTIMAL SEQUENCE BY DYNAMIC-PROGRAMMING - EXTENSION TO PRECEDENCE-RELATED TASKS

被引：57

作者：

BAKER, KR ^{[1
]}

SCHRAGE, LE ^{[1
]}

机构：

[1] UNIV CHICAGO,CHICAGO,IL 60637

来源：

OPERATIONS RESEARCH | 1978年 / 26卷 / 01期

关键词：

D O I：

10.1287/opre.26.1.111

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Discussion of the dynamic programming approach to finding an optimal sequence of a set of tasks when the tasks are related by precedence restrictions. A description is presented of 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.

引用

页码：111 / 120

页数：10

共 9 条

[1]

Baker K., 1974, INTRO SEQUENCING SCH

[2]

BAKER KR, 1975, GSBA163 DUK U WORK P

[3] ONE-MACHINE SEQUENCING TO MINIMIZE CERTAIN FUNCTIONS OF JOB TARDINESS [J].