Minimizing the makespan for a serial-batching scheduling problem with arbitrary machine breakdown and dynamic job arrival

Many dynamic events exist in real manufacturing systems, such as arbitrary machine breakdowns and dynamic job arrivals, which makes the scheduling problem even more complicated. In this paper, we address a serial-batching scheduling problem with the above dynamic events. Jobs need to be processed on the serial-batching machines of two manufacturers and then transported by vehicles to a customer for further processing. The objective of the scheduling problem is to minimize the makespan, and the problem is proved to be strongly NP-hard. Some structural properties and a lower bound of the problem are also proved or derived. On the basis of job arrival times, we divide the problem into two phases and propose different rules regarding these two phases. Based on these properties and rules, a heuristic algorithm is developed to solve the problem and its worst case performance is analyzed. The heuristic algorithm is tested on a large set of randomly generated problem instances, and the relative gaps between the found lower bound and the solutions of the proposed heuristic algorithm are reported. The experimental results illustrate the high efficiency and effectiveness of the proposed heuristic algorithm compared with other four classic approaches.

[1]  Mostafa Zandieh,et al.  Dynamic job shop scheduling using variable neighbourhood search , 2010 .

[2]  Li-Chen Fu,et al.  A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival , 2010, Comput. Oper. Res..

[3]  P. Chang,et al.  A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem , 2006 .

[4]  Hui Zhang,et al.  Two-stage hybrid flow shop scheduling with dynamic job arrivals , 2012, Comput. Oper. Res..

[5]  Ruhul A. Sarker,et al.  Genetic algorithm for job-shop scheduling with machine unavailability and breakdowns , 2011 .

[6]  Lixin Tang,et al.  Steelmaking and refining coordinated scheduling problem with waiting time and transportation consideration , 2010, Comput. Ind. Eng..

[7]  Shanlin Yang,et al.  Single machine serial-batching scheduling with independent setup time and deteriorating job processing times , 2015, Optim. Lett..

[8]  Fariborz Jolai,et al.  Flow shop scheduling with two batch processing machines and nonidentical job sizes , 2009 .

[9]  Fariborz Jolai,et al.  A variable neighborhood search for job shop scheduling with set-up times to minimize makespan , 2009, Future Gener. Comput. Syst..

[10]  Shanlin Yang,et al.  Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan , 2015, Eur. J. Oper. Res..

[11]  Oliver Holthaus,et al.  Scheduling in job shops with machine breakdowns: an experimental study , 1999 .

[12]  T.C.E. Cheng,et al.  Single machine serial-batching scheduling problem with a common batch size to minimize total weighted completion time , 2007 .

[13]  Abdelhakim Artiba,et al.  Stochastic single machine scheduling with random common due date , 2012 .

[14]  D. Quadt,et al.  Conceptual framework for lot-sizing and scheduling of flexible flow lines , 2005 .

[15]  Kai Wang,et al.  A decomposition-based approach to flexible flow shop scheduling under machine breakdown , 2012 .

[16]  Marcelo Seido Nagano,et al.  A new evolutionary clustering search for a no-wait flow shop problem with set-up times , 2012, Eng. Appl. Artif. Intell..

[17]  Roberto Musmanno,et al.  Robust scheduling of parallel machines with sequence-dependent set-up costs , 2005, Eur. J. Oper. Res..

[18]  Hua Xuan,et al.  Scheduling a hybrid flowshop with batch production at the last stage , 2007, Comput. Oper. Res..

[19]  Shih-Wei Lin,et al.  Scheduling jobs on dynamic parallel machines with sequence-dependent setup times , 2010 .

[20]  Panos M. Pardalos,et al.  Supply Chain Optimization , 2007 .

[21]  Richard Romanowski,et al.  Multi-contextual ant colony optimization of intermediate dynamic job shop problems , 2012 .

[22]  Martin Steinrücke.  An approach to integrate production-transportation planning and scheduling in an aluminium supply chain network , 2011 .

[23]  A. Naveen Sait,et al.  Performance evaluation of proposed Differential Evolution and Particle Swarm Optimization algorithms for scheduling m-machine flow shops with lot streaming , 2013, J. Intell. Manuf..

[24]  Fariborz Jolai,et al.  A two-stage hybrid flowshop scheduling problem in machine breakdown condition , 2013, J. Intell. Manuf..

[25]  Cristovao Silva,et al.  Improving the applicability of workload control (WLC): the influence of sequence-dependent set-up times on workload controlled job shops , 2012 .

[26]  T. C. Edwin Cheng,et al.  On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times , 2003, Oper. Res. Lett..

[27]  Lixin Tang,et al.  Two-machine flowshop scheduling with intermediate transportation under job physical space consideration , 2011, Comput. Oper. Res..

[28]  Tsung-Shin Hsu,et al.  A new heuristic algorithm for the machine scheduling problem with job delivery coordination , 2009, Theor. Comput. Sci..

[29]  Yeong-Dae Kim,et al.  Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance , 2012, Comput. Oper. Res..

[30]  Feng Li,et al.  Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations , 2014 .

[31]  Paolo Detti,et al.  A bi-objective coordination setup problem in a two-stage production system , 2008, Eur. J. Oper. Res..

[32]  P. D. D. Dominic,et al.  Efficient dispatching rules for dynamic job shop scheduling , 2003 .

[33]  Mohsen Varmazyar,et al.  Sequence-dependent flow shop scheduling problem minimising the number of tardy jobs , 2012 .

[34]  Jian Xiong,et al.  Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns , 2013 .

[35]  Chris N. Potts,et al.  Supply chain scheduling: Batching and delivery , 2003, Oper. Res..

[36]  Scott J. Mason,et al.  Multi-objective analysis of an integrated supply chain scheduling problem , 2012 .

[37]  Yi-Chih Hsieh,et al.  A heuristic approach to a single stage assembly problem with transportation allocation , 2012, Appl. Math. Comput..

[38]  Babak Abbasi,et al.  An efficient tabu search algorithm for flexible flow shop sequence-dependent group scheduling problems , 2012 .

[39]  Zhibin Jiang,et al.  A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals , 2012, Comput. Oper. Res..

[40]  Jonathan F. Bard,et al.  A branch-and-price algorithm for an integrated production and inventory routing problem , 2010, Comput. Oper. Res..

[41]  Lixin Tang,et al.  Minimizing makespan in a two-machine flowshop scheduling with batching and release time , 2009, Math. Comput. Model..

[42]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[43]  Mostafa Hajiaghaei-Keshteli,et al.  Genetic algorithms for coordinated scheduling of production and air transportation , 2010, Expert Syst. Appl..

[44]  Shanlin Yang,et al.  Application of an effective modified gravitational search algorithm for the coordinated scheduling problem in a two-stage supply chain , 2014 .