Coke production scheduling problem: A parallel machine scheduling with batch preprocessings and location-dependent processing times

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01955790
Contributor : Frédéric Davesne <>
Submitted on : Friday, December 14, 2018 - 3:54:48 PM
Last modification on : Monday, October 28, 2019 - 10:50:22 AM

Identifiers

Citation

Ming Liu, Feng Chu, Junkai He, Dapeng Yang, Chengbin Chu. Coke production scheduling problem: A parallel machine scheduling with batch preprocessings and location-dependent processing times. Computers and Operations Research, Elsevier, 2019, 104, pp.37--48. ⟨10.1016/j.cor.2018.12.002⟩. ⟨hal-01955790⟩

Share

Metrics

Record views

300