Some results on the optimal scheduling of a single-machine multi-product pull system
暂无分享,去创建一个
We consider the problem of dynamically allocating production capacity between two products to minimize the average inventory and backorder costs per unit time in a make-to-stock single machine system. Using sample path comparisons and dynamic programming, we give a characterization of the optimal hedging point policy for a certain region of the state space.
[1] Paul H. Zipkin,et al. Dynamic Scheduling Rules for a Multiproduct Make-to-Stock Queue , 1997, Oper. Res..
[2] Lawrence M. Wein,et al. Scheduling a Make-To-Stock Queue: Index Policies and Hedging Points , 1996, Oper. Res..
[3] Paul Zipkin,et al. A Queueing Model to Analyze the Value of Centralized Inventory Information , 1990, Oper. Res..
[4] Lawrence M. Wein,et al. Dynamic Scheduling of a Multiclass Make-to-Stock Queue , 2015, Oper. Res..