透過您的圖書館登入
IP:13.58.182.39
  • 期刊

A New Recursive Algorithm for the Production/Ordering Problem with Limited Storage

摘要


Based on the research on the optimization model of production/ordering planning problem, this paper presents a new recursive algorithm, taking the sum of the total production cost and holding cost as the minimization criteria, to get the correct range of the both variables of stage k production and storage, and finally to get the optimal decision. In the contrast, exsiting normal dynamic programming algorithm could in some events result in a wrong range of the both variables and optimal decision would not be reached.

參考文獻


Step out–Step in sequencing games [J]. M. Musegaas,P.E.M. Borm,M. Quant. European Journal of Operational Research. 2015 (3).
Proportionate flow-shop scheduling with rejection [J] . Dvir Shabtay,Daniel Oron. The Journal of the Operational Research Society. 2016 (5).
Rescheduling due to machine disruption to minimize the total weighted completion time [J] . Wenchang Luo, Taibo Luo,Randy Goebel,Guohui Lin. Journal of Scheduling . 2018 (5).
Parallel-machine rescheduling with job unavailability and rejection [J]. Dujuan Wang,Yunqiang Yin, T.C.E. Cheng.Omega . 2018.
Frederick S. Hillier and Gerald J. Lieberman. Introduction to Operations Research (Ninth Edition)[M]. Beijing: Tsinghua University Press , 2010.

延伸閱讀