سال انتشار: ۱۳۸۰

محل انتشار: اولین کنفرانس ملی مهندسی صنایع

تعداد صفحات: ۱۱

نویسنده(ها):

Azaron – Department of Industrial Engineering, Faculty of Engineering, Bu_Ali_Sina University, Hamedan, Iran
Kianfar – Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran

چکیده:

This paper develops a method for solving the single product multiperiod production planning problem, in which the production cost of each period is linear and the inventory cost of each period is concave and backlogging is not permitted. It is also assumed that the unit variable cost of the production evolves according to a continuous time Markov process. We prove that this production planning problem can be stated as a
problem of finding the dynamic shortest path from the source node to the sink node. Finally, we apply the stochastic dynamic programming to find the dynamic shortest path from the source node to the sink node and obtain the optimal production scheduled for each period.