Production scheduling in a steelmaking- continuous casting plant using Lagrangian relaxation and a network model

This paper focuses on the scheduling problem in steelmaking-continuous casting plant and uses Lagrangian relaxation technique for its solution. A network model of problem is introduced that after decomposition of original problem to subproblem by using of Lagrangian multipliers and relaxing of hard constraints, several minimum cost flow problems as subproblems is generated. The purpose of this paper is to minimize the holding time of molten steel in ladles in production line with respect to on-time delivery of products. The numerical results show the effectiveness of this approach

کلیدواژه ها:

Scheduling ، Production Planning ، Lagrangian relaxation ، Shortest Path problem ، Minimum Cost Network Flow