A stochastic dynamic programming model for multi-site capacity planning in TFT-LCD industry

Author(s):  
James T. Lin ◽  
Tzu-Li Chen
Transport ◽  
2005 ◽  
Vol 20 (6) ◽  
pp. 236-239 ◽  
Author(s):  
Andrius Jaržemskis

The article presents the model of allotments booking for trucks or containers in shuttle trains. This model could be used in practice if railway companies sale free allotments in rolling stock for forwarders. This paper proposes a stochastic dynamic programming model of a short‐term capacity planning model for necessary allotment. The allotment could be acquired by freight forwarders many months ahead on a contract basis, but usually the forecast demand is unreliable. The preplanning of allotment for transport units is needed when the date draws nearer to the train departure time. The presented model evaluates the optimal cost policy based on economic trade‐off between the cost of backlogged shipment and the cost of acquiring additional allotment.


1987 ◽  
Vol 35 (2) ◽  
pp. 195-197
Author(s):  
R.B.M. Huirne ◽  
A.A. Dijkhuizen ◽  
G.W.J. Giesen

A stochastic dynamic programming model was designed to determine the economically optimum replacement decisions for sows. Influences of changes in production and prices on the optimum policy were established. An economic index was calculated to be used as a culling guide for individual sows. (Abstract retrieved from CAB Abstracts by CABI’s permission)


Sign in / Sign up

Export Citation Format

Share Document