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.

[1]  Kenli Li,et al.  An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs , 2014, Theor. Comput. Sci..

[2]  Feng Chu,et al.  Two Yard Crane Scheduling With Dynamic Processing Time and Interference , 2018, IEEE Transactions on Intelligent Transportation Systems.

[3]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[4]  Stanislaw Gawiejnowicz,et al.  Isomorphic scheduling problems , 2012, Annals of Operations Research.

[5]  Ertan Güner,et al.  Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs , 2010, J. Intell. Manuf..

[6]  David E. Goldberg,et al.  Genetic algorithms and Machine Learning , 1988, Machine Learning.

[7]  Dvir Shabtay,et al.  A survey of scheduling with controllable processing times , 2007, Discret. Appl. Math..

[8]  Bahram Alidaee,et al.  Scheduling with time dependent processing times: Review and extensions , 1999, J. Oper. Res. Soc..

[9]  Abalfazl Zareei,et al.  Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs , 2010 .

[10]  Iraj Mahdavi,et al.  Design a bi-objective mathematical model for cellular manufacturing systems considering variable failure rate of machines , 2014 .

[11]  Stanislaw Gawiejnowicz,et al.  Time-Dependent Scheduling , 2008, Monographs in Theoretical Computer Science. An EATCS Series.

[12]  Chou-Jung Hsu,et al.  Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time , 2012, Optimization Letters.

[13]  Jian Liang,et al.  Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs , 2012 .

[14]  Stanislaw Gawiejnowicz,et al.  A Note on Scheduling on a Single Processor with Speed Dependent on a Number of Executed Jobs , 1996, Inf. Process. Lett..

[15]  Stanislaw Gawiejnowicz,et al.  Equivalent time-dependent scheduling problems , 2009, Eur. J. Oper. Res..

[16]  Goutam Dutta,et al.  A Survey of Mathematical Programming Applications in Integrated Steel Plants , 2001, Manuf. Serv. Oper. Manag..

[17]  Stanislaw Gawiejnowicz,et al.  Pareto and scalar bicriterion optimization in scheduling deteriorating jobs , 2006, Comput. Oper. Res..

[18]  Adam Janiak,et al.  Scheduling jobs with position-dependent processing times , 2004, J. Oper. Res. Soc..

[19]  Alessandro Agnetis,et al.  Multiagent Scheduling - Models and Algorithms , 2014 .

[20]  Eduardo Lalla-Ruiz,et al.  Modeling the Parallel Machine Scheduling Problem with Step Deteriorating Jobs , 2016, Eur. J. Oper. Res..

[21]  Vitaly A. Strusevich,et al.  Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches , 2018, Eur. J. Oper. Res..

[22]  Ming Liu,et al.  Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect , 2013 .