TY - JOUR
T1 - Decomposition Method for New Single-Machine Scheduling Problems from Steel Production Systems
AU - Zhao, Ziyan
AU - Liu, Shixin
AU - Zhou, Meng Chu
AU - Guo, Xiwang
AU - Qi, Liang
N1 - Funding Information:
Manuscript received August 21, 2019; accepted November 6, 2019. Date of publication December 30, 2019; date of current version July 2, 2020. This article was recommended for publication by Associate Editor M. Dotoli and Editor J. Li upon evaluation of the reviewers’ comments. This work was supported in part by the China Scholarship Council Scholarship, in part by the National Key Research and Development Program of China under Grant 2017YFB0304200, and in part by the National Natural Science Foundation of China under Grant 61573089 and Grant 61903229. This article was presented at the 2019 IEEE 16th International Conference on Networking, Sensing and Control (ICNSC), Banff, Canada, 2019. (Corresponding authors: Shixin Liu; MengChu Zhou.) Z. Zhao is with the State Key Laboratory of Synthetical Automation for Process Industries, College of Information Science and Engineering, North-eastern University, Shenyang 110819, China, and also with the Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ 07102 USA (e-mail: neuzhaoziyan@163.com).
Publisher Copyright:
© 2004-2012 IEEE.
PY - 2020/7
Y1 - 2020/7
N2 - Production scheduling is a crucial task in modern steel plants. The scheduling of a wire rod and bar rolling process is challenging in many steel plants, which has a direct impact on their production efficiency and profit. This article studies a new single-machine scheduling problem with sequence-dependent setup time, release time, and due time constraints originated from a wire rod and bar rolling process in steel plants. In this problem, jobs have been assigned to batches in advance. The objective is to schedule the batches and jobs on continuous time to minimize the number of late jobs. A mixed-integer program is created as a baseline model. A baseline method is used to solve this NP-hard problem by solving the baseline model. We further design a two-stage decomposition method after analyzing the characteristics of this problem. Both actual and simulated instances with varying sizes are solved by using the proposed methods. The results demonstrate that the baseline method can only solve some small-scale cases, while the decomposition method can solve all small-scale cases and some medium-scale cases. Finally, we reveal the impacts of different instances on the performance of the proposed decomposition method. Note to Practitioners-This article deals with a new single-machine scheduling problem arising from an industrial wire rod and bar rolling process. A baseline method is given to tackle this problem by solving an established mixed-integer program. Afterward, a two-stage decomposition method is proposed such that an industrial size problem can be solved. Computational results of both actual and simulated cases show that it is more efficient than the baseline method in solving the scheduling problem. It can get an optimal solution of the concerned problem with one-week-scale batches and jobs in short time, thereby proving the readiness to put it in industrial use.
AB - Production scheduling is a crucial task in modern steel plants. The scheduling of a wire rod and bar rolling process is challenging in many steel plants, which has a direct impact on their production efficiency and profit. This article studies a new single-machine scheduling problem with sequence-dependent setup time, release time, and due time constraints originated from a wire rod and bar rolling process in steel plants. In this problem, jobs have been assigned to batches in advance. The objective is to schedule the batches and jobs on continuous time to minimize the number of late jobs. A mixed-integer program is created as a baseline model. A baseline method is used to solve this NP-hard problem by solving the baseline model. We further design a two-stage decomposition method after analyzing the characteristics of this problem. Both actual and simulated instances with varying sizes are solved by using the proposed methods. The results demonstrate that the baseline method can only solve some small-scale cases, while the decomposition method can solve all small-scale cases and some medium-scale cases. Finally, we reveal the impacts of different instances on the performance of the proposed decomposition method. Note to Practitioners-This article deals with a new single-machine scheduling problem arising from an industrial wire rod and bar rolling process. A baseline method is given to tackle this problem by solving an established mixed-integer program. Afterward, a two-stage decomposition method is proposed such that an industrial size problem can be solved. Computational results of both actual and simulated cases show that it is more efficient than the baseline method in solving the scheduling problem. It can get an optimal solution of the concerned problem with one-week-scale batches and jobs in short time, thereby proving the readiness to put it in industrial use.
KW - Due time
KW - release time
KW - sequence-dependent setup time
KW - single-machine scheduling
KW - two-stage decomposition
UR - http://www.scopus.com/inward/record.url?scp=85077312029&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85077312029&partnerID=8YFLogxK
U2 - 10.1109/TASE.2019.2953669
DO - 10.1109/TASE.2019.2953669
M3 - Article
AN - SCOPUS:85077312029
SN - 1545-5955
VL - 17
SP - 1376
EP - 1387
JO - IEEE Transactions on Automation Science and Engineering
JF - IEEE Transactions on Automation Science and Engineering
IS - 3
M1 - 8945211
ER -