A flexible job shop scheduling approach with operators for coal export terminals

Abstract Operating a coal export terminal (CET) is a challenging task. The throughput of the terminal and the delays incurred by ships and trains is greatly affected by where material is stacked and reclaimed, and which machinery is used to perform those tasks. To improve the operation of these terminals, and to make the aforementioned decisions, a novel optimisation approach has been developed. In that approach the CET is modelled as a flexible job shop with operators (FJSOP). The optimization problem is then solved using an advanced meta-heuristic algorithm that incorporates a variety of sophisticated perturbation techniques, local improvement algorithms and pre-emption handling procedures. That level of intricacy is rarely required for more traditional scheduling problems but is a necessity for this one. A key component used in the optimisation process is a priority ordering of the activities. The priority ordering is used to create the required activity sequences, for each piece of machinery. This list dictates the order in which activities are scheduled and can be perturbed quickly and in many different ways, leading to the identification of improved solutions. The optimization approach is applied to an Australian coal terminal to demonstrate its viability and effectiveness. Numerical testing shows that problems of the size encountered by existing terminals can be handled and high quality solutions can be obtained with reasonable computing effort.

[1]  María R. Sierra,et al.  Memetic algorithms for the job shop scheduling problem with operators , 2015, Appl. Soft Comput..

[2]  Alessandro Agnetis,et al.  A job shop scheduling problem with human operators in handicraft production , 2014 .

[3]  Erhan Kozan,et al.  An integrated approach for scheduling health care activities in a hospital , 2018, Eur. J. Oper. Res..

[4]  Erhan Kozan,et al.  An integrated approach for earthwork allocation, sequencing and routing , 2014, Eur. J. Oper. Res..

[5]  Erhan Kozan,et al.  Scheduling Trains on Parallel Lines with Crossover Points , 2009, J. Intell. Transp. Syst..

[6]  Zhenqiang Yao,et al.  Stacker-reclaimer scheduling in a dry bulk terminal , 2012, Int. J. Comput. Integr. Manuf..

[7]  Jian-jun Yang,et al.  Flexible job-shop scheduling with flexible workdays, preemption, overlapping in operations and satisfaction criteria: an industrial application , 2016 .

[8]  Manoj Kumar Tiwari,et al.  Minimizing delay of ships in bulk terminals by simultaneous ship scheduling, stockyard planning and train scheduling , 2015 .

[9]  Martin W. P. Savelsbergh,et al.  A stockyard planning problem , 2012, EURO J. Transp. Logist..

[10]  R. L. Burdett,et al.  A SEQUENCING APPROACH FOR TRAIN TIMETABLING , 2007 .

[11]  Chengkuan Zeng,et al.  Scheduling of no buffer job shop cells with blocking constraints and automated guided vehicles , 2014, Appl. Soft Comput..

[12]  F. Pezzella,et al.  A genetic algorithm for the Flexible Job-shop Scheduling Problem , 2008, Comput. Oper. Res..

[13]  James C. Chen,et al.  Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm , 2012, Expert Syst. Appl..

[14]  Reinhard Bürgy,et al.  The flexible blocking job shop with transfer and set-up times , 2011, J. Comb. Optim..

[15]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[16]  María R. Sierra,et al.  Robust Solutions to Job-Shop Scheduling Problems with Operators , 2012, 2012 IEEE 24th International Conference on Tools with Artificial Intelligence.

[17]  Erhan Kozan,et al.  A disjunctive graph model and framework for constructing new train schedules , 2010, Eur. J. Oper. Res..

[18]  Liang Gao,et al.  An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem , 2009, Comput. Ind. Eng..

[19]  Quan-Ke Pan,et al.  Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling , 2014, Inf. Sci..

[20]  Erhan Kozan,et al.  Techniques for inserting additional trains into existing timetables , 2009 .

[21]  Frank Werner,et al.  A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria , 2009, Comput. Oper. Res..

[22]  Hyoung-Ho Doh,et al.  A priority scheduling approach for flexible job shops with multiple process plans , 2013 .

[23]  Mehmet Fatih Tasgetiren,et al.  Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion , 2015, Comput. Ind. Eng..

[24]  Martin W. P. Savelsbergh,et al.  Scheduling reclaimers serving a stock pad at a coal terminal , 2017, J. Sched..

[25]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[26]  Mostafa Zandieh,et al.  Flexible job-shop scheduling with parallel variable neighborhood search algorithm , 2010, Expert Syst. Appl..

[27]  Wajdi Trabelsi,et al.  Hybrid job shop scheduling with mixed blocking constraints between operations , 2015, ETFA.

[28]  Alessandro Agnetis,et al.  A job-shop problem with one additional resource type , 2011, J. Sched..

[29]  Erhan Kozan,et al.  Job scheduling with technical constraints , 2004, J. Oper. Res. Soc..