TY - JOUR
T1 - Coke production scheduling problem
T2 - A parallel machine scheduling with batch preprocessings and location-dependent processing times
AU - Liu, Ming
AU - Chu, Feng
AU - He, Junkai
AU - Yang, Dapeng
AU - Chu, Chengbin
N1 - Publisher Copyright:
© 2018
PY - 2019/4/1
Y1 - 2019/4/1
N2 - In this paper, an integer programming model is developed for a newly addressed coke production scheduling problem, in which two typical characteristics are considered: (i) The transportation of raw coal by a vehicle causes a batch preprocessing; (ii) The heating of raw coal by closely located coke ovens may extend the processing times of cokes, under the temperature influence. To the best of our knowledge, such a geographically location-dependent processing time has not been studied. The purpose is to minimize the completion time of the last coke among all ovens, i.e., the makespan. Therefore, the problem of interest can be viewed as a parallel machine makespan minimization scheduling problem, featured with batch preprocessings and location-dependent processing times. For this NP-hard problem, a problem-specific genetic algorithm and a fast heuristic are devised to enhance the computational efficiency. Experimental results on 330 randomly generated instances show the effectiveness and efficiency of the proposed solution methods.
AB - In this paper, an integer programming model is developed for a newly addressed coke production scheduling problem, in which two typical characteristics are considered: (i) The transportation of raw coal by a vehicle causes a batch preprocessing; (ii) The heating of raw coal by closely located coke ovens may extend the processing times of cokes, under the temperature influence. To the best of our knowledge, such a geographically location-dependent processing time has not been studied. The purpose is to minimize the completion time of the last coke among all ovens, i.e., the makespan. Therefore, the problem of interest can be viewed as a parallel machine makespan minimization scheduling problem, featured with batch preprocessings and location-dependent processing times. For this NP-hard problem, a problem-specific genetic algorithm and a fast heuristic are devised to enhance the computational efficiency. Experimental results on 330 randomly generated instances show the effectiveness and efficiency of the proposed solution methods.
KW - Batch preprocessings
KW - Coke production
KW - Integer programming
KW - Location-dependent processing times
KW - Scheduling
U2 - 10.1016/j.cor.2018.12.002
DO - 10.1016/j.cor.2018.12.002
M3 - Article
AN - SCOPUS:85057624547
SN - 0305-0548
VL - 104
SP - 37
EP - 48
JO - Computers and Operations Research
JF - Computers and Operations Research
ER -