Title
Iterated Greedy Algorithm for Solving a New Single Machine Scheduling Problem
Abstract
This paper studies a new single machine scheduling problem with sequence-dependent setup time, release time, due time and group technology assumption originated from a wire rod and bar rolling process in steel plants. The objective is to find an optimal batch sequence and job sequences of all batches to minimize the number of late jobs. A two-stage mixed integer program is created to describe and solve this problem. The first stage can be solved in a short time by CPLEX while the second one is time-consuming when dealing with large-scale cases. Thus, an iterated greedy algorithm able to solve the second stage fast is developed. The experimental results demonstrate that the proposed two-stage mixed integer program can be solved optimally by CPLEX for small-scale cases and the proposed algorithm can effectively solve the second stage for large-scale cases.
Year
DOI
Venue
2019
10.1109/ICNSC.2019.8743328
2019 IEEE 16th International Conference on Networking, Sensing and Control (ICNSC)
Keywords
Field
DocType
Single machine scheduling,two-stage integer program,iterated greedy algorithm,CPLEX,wire rod and bar rolling process
Integer,Single-machine scheduling,Mathematical optimization,Control theory,Computer science,Group technology,Iterated greedy algorithm
Conference
ISSN
ISBN
Citations 
1810-7869
978-1-7281-0085-2
1
PageRank 
References 
Authors
0.35
15
5
Name
Order
Citations
PageRank
Ziyan Zhao1152.27
Shixin Liu2837.03
MengChu Zhou38989534.94
Xiwang Guo4342.67
Jialun Xue510.35