TY - JOUR
T1 - A Lexicographic Bi-objective Scheduling Problem from Steel Production Systems
AU - Zhao, Ziyan
AU - Zhou, Meng Chu
AU - Liu, Shixin
AU - Guo, Xiwang
AU - Liu, Haoyue
N1 - Funding Information:
This work was in part supported by the China Scholarship Council scholarshipˇ National Key R&D Proffiram off China under Grant No. 2017YFB0304200ˇ and National Natural Science Foundation off China under Grant No. 62073069.
Publisher Copyright:
© 2020 Elsevier B.V.. All rights reserved.
PY - 2020
Y1 - 2020
N2 - Wire rod and bar rolling is an essential process in a steel production system (SPS). This work considers a lexicographic bi-objective scheduling problem originated from it. As a medium process in SPS, both the impacts of its upstream process, i.e., release time constraints, and the requirements of its downstream process, i.e., due time constraints, on SPS performance, must be considered. The concerned problem aims to minimize the number of tardy tasks as a main objective and total setup time as a secondary one. It is solved via a two-stage method. The first-stage problem is handled with an off-the-shelf optimization software, and the second one with iterated greedy algorithms (IGAs). We compare the performance of IGAs under different strategies and select the best one to solve it. By comparing the experimental results an exact single-objective method's, this paper shows that the proposed method can solve the problem fast with excellent results in terms of the number of tardy tasks and setup time, i.e., the secondary objective, on average. Its usage can result in significant performance improvement in steel production over the existing practice.
AB - Wire rod and bar rolling is an essential process in a steel production system (SPS). This work considers a lexicographic bi-objective scheduling problem originated from it. As a medium process in SPS, both the impacts of its upstream process, i.e., release time constraints, and the requirements of its downstream process, i.e., due time constraints, on SPS performance, must be considered. The concerned problem aims to minimize the number of tardy tasks as a main objective and total setup time as a secondary one. It is solved via a two-stage method. The first-stage problem is handled with an off-the-shelf optimization software, and the second one with iterated greedy algorithms (IGAs). We compare the performance of IGAs under different strategies and select the best one to solve it. By comparing the experimental results an exact single-objective method's, this paper shows that the proposed method can solve the problem fast with excellent results in terms of the number of tardy tasks and setup time, i.e., the secondary objective, on average. Its usage can result in significant performance improvement in steel production over the existing practice.
KW - Batch process
KW - batch scheduling
KW - iterated greedy algorithm
KW - lexicographic bi-objective optimization
KW - steel production systems
UR - http://www.scopus.com/inward/record.url?scp=85107865492&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85107865492&partnerID=8YFLogxK
U2 - 10.1016/j.ifacol.2021.04.140
DO - 10.1016/j.ifacol.2021.04.140
M3 - Conference article
AN - SCOPUS:85107865492
SN - 2405-8963
VL - 53
SP - 158
EP - 163
JO - IFAC-PapersOnLine
JF - IFAC-PapersOnLine
IS - 5
T2 - 3rd IFAC Workshop on Cyber-Physical and Human Systems, CPHS 2020
Y2 - 3 December 2020 through 5 December 2020
ER -