Search Results - subject:"dynamic programming"

The Parameter Iteration Method in Dynamic Programming

Gal, Shmuel - In: Management Science 35 (1989) 6, pp. 675-684

problems lead to dynamic programming problems with a very large number of state variables. Thus, an exact derivation of the …

Persistent link: https://www.econbiz.de/10009191514

A Dynamic Programming Approach to Stochastic Assembly Line Balancing

Carraway, Robert L. - In: Management Science 35 (1989) 4, pp. 459-471

station being completed within the cycle time. We present two dynamic programming (DP) algorithms for this problem, each …, R. Shareshian. 1963. Assembly-line-balancing-dynamic programming with precedence constraints. Oper. Res. 11 442 …. I. 1986. Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing …

Persistent link: https://www.econbiz.de/10009197910

The optimality of capacity sharing in stochastic dynamic programming problems of shared reservoir operation

Alaouze, Chris M. - 1989

Persistent link: https://www.econbiz.de/10000796085

Optimization

Nemhauser, George L. (contributor); … - 1989

Persistent link: https://www.econbiz.de/10011519338

Recursive methods in economic dynamics

Stokey, Nancy L.; Lucas, Robert E.; Prescott, Edward C. - 1989

Persistent link: https://www.econbiz.de/10013503023

Optimally Balancing Large Assembly Lines with "Fable"

Johnson, Roger V. - In: Management Science 34 (1988) 2, pp. 240-253

A new algorithm for optimally balancing assembly lines is formulated and tested. Named "FABLE," it obtains proven optimal solutions for ten 1000 task lines, which each possess the computationally favorable conditions of an average of at least 6 tasks per work station and a small number of...

Persistent link: https://www.econbiz.de/10009191390

An O(T<sup>2</sup>) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem

Chung, Chia-Shin; Lin, Chien-Hua Mike - In: Management Science 34 (1988) 3, pp. 420-426

. It is proven that only the candidate subplans need to be examined in searching for an optimal solution. A dynamic … programming algorithm, incorporating the concept of candidate subplan, is then devised which has run time complexity of O(T<sup>2 …

Persistent link: https://www.econbiz.de/10009198124

Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs

Potts, C. N.; Wassenhove, L. N. Van - In: Management Science 34 (1988) 7, pp. 843-858

algorithms that use this and other lower bounds and with a dynamic programming algorithm for problems with up to 1000 jobs are …

Persistent link: https://www.econbiz.de/10009218029

Analytic derivatives for estimation of discrete-time, linear-quadratic, dynamic, optimization models

Zadrozny, Peter A. - In: Econometrica : journal of the Econometric Society, an … 56 (1988) 2, pp. 467-472

Persistent link: https://www.econbiz.de/10001041540

Simultaneous and dynamic price, production inventory and capacity decisions

Gaimon, Cheryl - In: European journal of operational research : EJOR 35 (1988) 3, pp. 426-441

Persistent link: https://www.econbiz.de/10003556224