A Lagrangian relaxation algorithm for the order planning of steel pipe

作者：Xuan Hua

来源：International Conference of Management Science and Information System, 2009-09-28 to 2009-09-30.

• steel pipe
• order planning
• integer programming
• Lagrangian relaxation
• speed-up dynamic programming

In this paper we investigate the order planning of steel pipe considering Tianjin Pipe Corporation, China, as the research background. The production of steel pipe consists of a series of operations and can be viewed as flowshop scheduling. The objective is to find a schedule that minimizes the total weighted completion times of orders. An integer programming model is established and a Lagrangian relaxation method is presented for this problem. In this method, speed-up backward dynamic programming and a two-phase heuristic are designed for solving Lagrangian subproblems and feasible schedules respectively. A numerical experiment is performed to examine the performance of our algorithm according to the practical production of Tianjin Pipe Corporation. Testing results on different problem sizes show that this method can obtain a high quality solution in a shorter computation time.

• 出版日期2009
• 单位郑州大学