论文信息 - The Construction of Discrete Dynamic Programming Algorithms - 字舞流文

The Construction of Discrete Dynamic Programming Algorithms

Certain sequencing and scheduling problems are formulated as shortest-route problems and treated in a uniform manner by dynamic programming. Computational considerations are discussed.

R. M. Karp | M. Held

[1] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .

[2] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[3] M. Held,et al. Assembly-Line Balancing---Dynamic Programming with Precedence Constraints , 1963 .

[4] G. Dantzig. On the Shortest Route Through a Network , 1960 .

[5] James E. Kelley,et al. Critical-Path Planning and Scheduling: Mathematical Basis , 1961 .

[6] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[7] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .

[8] Maurice Pollack,et al. SOLUTIONS OF THE SHORTEST-ROUTE PROBLEM-A REVIEW , 1960 .