A starting-time-based approach to production scheduling with Particle Swarm Optimization

This paper provides a generic formulation for the complex scheduling problems of Optimatix, a South African company specializing in supply chain optimization. To address the complex requirements of the proposed problem, various additional constraints were added to the classical job shop scheduling problem. These include production downtime, scheduled maintenance, machine breakdowns, sequence-dependent set-up times, release dates and multiple predecessors per job. Differentiation between primary resources (machines) and auxiliary resources (labour, tools and jigs) were also achieved. Furthermore, this paper applies particle swarm optimization (PSO), a stochastic population based optimization technique originating from the study of social behavior of birds and fish, to the proposed problem. Apart from the significance of the paper in that the proposed problem has not been addressed before, the benefit of an improved production schedule can be generalized to include cost reduction, customer satisfaction, improved profitability and overall competitive advantage

[1]  Xiaodong Li,et al.  Particle swarm optimization-based schemes for resource-constrained project scheduling , 2005 .

[2]  Marc Lambrecht,et al.  Extending the shifting bottleneck procedure to real-life applications , 1996 .

[3]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[4]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

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

[6]  Krishna R. Pattipati,et al.  A practical approach to job-shop scheduling problems , 1993, IEEE Trans. Robotics Autom..

[7]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[8]  A. G. Lockett,et al.  Technical Note - A Scheduling Problem Involving Sequence Dependent Changeover Times , 1972, Oper. Res..

[9]  Bin Jiao,et al.  A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan , 2006, Appl. Math. Comput..

[10]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[11]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[12]  Haibin Yu,et al.  Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling , 2001 .

[13]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

[14]  R. Saravanan,et al.  Scheduling optimisation of flexible manufacturing systems using particle swarm optimisation algorithm , 2005 .

[15]  Mostafa Zandieh,et al.  An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times , 2006, Appl. Math. Comput..

[16]  Hark Hwang,et al.  Production sequencing problem with reentrant work flows and sequence dependent setup times , 1997 .

[17]  Zhang Wei,et al.  A new hybrid optimization algorithm for the job-shop scheduling problem , 2004, Proceedings of the 2004 American Control Conference.

[18]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[19]  Jean-Charles Billaut,et al.  Production , Manufacturing and Logistics A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation , 2004 .