SOLVING THE CUTTING STOCK PROBLEM IN THE MANUFACTURING TO ORDER STEEL PRODUCTION
For the manufacturing of steel products, all products are processed sequentially through three stages of processes, refining, continuous casting, and rolling, in which the cutting pattern planning will be directly related to the detail planning and scheduling among the processes. For a manufacturing to order steel factory including three stages of processes, the productions at theses processes are inter-related and should be coordinated rather than being treated as mutually independent. That is, rather than establishing high level of work-in-process between stages, the production coordination among the process stages is conducted through the cutting pattern planning to meet the summarized demands of customers in the perspective of product specification. In this paper we consider the one-dimension cutting stock problem with the objective to minimizing the total inventory, in which the demands of all product specifications should be satisfied. At the rolling mill, steel products of specific length are produced by cutting the milled steel, transformed from a beam billet or a bloom, corresponding to some specific pattern in the cutting plan. An integer programming model is firstly developed to solve the cutting problem optimally, and then a two-stage programming model is proposed to derive a solution of quality in a short time. To obtain an optimal solution for the considered problem, three categories of decision variables should be solved simultaneously, that is, the number of cutting patterns, the vector variables in a cutting pattern, and the repeated runs for a pattern, which implies the complexity of the problem and usually can not be solve optimally within accepted time. The two-phase model first finds a limited number of superior patterns, rather than lists all possible patterns, through grouping certain product length types depending on the magnitudes of customer orders, then determines the repeated runs of all patterns in the list to generate a quality solution quickly. A comparison on the performances of the proposed models basing on actual customer orders is also provided.
one-dimension cutting planning problem manufacturing to order steel production integer programming model specification combination pattern
M.H. Yang C.K. Kao
Department of Business Management,National United University,1,Len-Da,Miao-Li,Taiwan Department of Industrial Engineering and Management,National Chiao Thng University,1001 University T
国际会议
上海
英文
1-6
2009-08-02(万方平台首次上网日期,不代表论文的发表时间)