Population-based dynamic scheduling optimisation for complex production process

This paper presents a population-based approximate scheduling approach for complex production process, by using heuristic stochastic optimisation strategies. In this approach, particle swarm optimisation (PSO) is adopted to find a near optimal operation sequence and schedule strategy based on the criterion of minimal total make-span (TMS) in its admissible sequence space. Discrete dynamic programming method is integrated for the usage of fitness evaluation. A minifab model is studied to illustrate the proposed population-based scheduling algorithm (PSA), which can approach the optimal results by computing partial solution sequences.

[1]  Meral Azizoglu,et al.  Dynamic programming algorithms for scheduling parallel machines with family setup times , 2001, Comput. Oper. Res..

[2]  Rafael S. Parpinelli,et al.  New inspirations in swarm intelligence: a survey , 2011, Int. J. Bio Inspired Comput..

[3]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[4]  Reha Uzsoy,et al.  Production scheduling algorithms for a semiconductor test facility , 1991 .

[5]  Daniel Quadt,et al.  Production planning in semiconductor assembly , 2003 .

[6]  S. N. Sivanandam,et al.  Dynamic task scheduling with load balancing using parallel orthogonal particle swarm optimisation , 2009, Int. J. Bio Inspired Comput..

[7]  E. Fernandez,et al.  An Approximate Dynamic Programming Approach for Job Releasing and Sequencing in a Reentrant Manufacturing Line , 2007, 2007 IEEE International Symposium on Approximate Dynamic Programming and Reinforcement Learning.

[8]  R. Bellman.  Dynamic programming. , 1957, Science.

[9]  Chengbin Chu,et al.  An improvement of the Lagrangean relaxation approach for job shop scheduling: a dynamic programming method , 1998, IEEE Trans. Robotics Autom..

[10]  Q. Henry Wu,et al.  Group Search Optimizer: An Optimization Algorithm Inspired by Animal Searching Behavior , 2009, IEEE Transactions on Evolutionary Computation.

[11]  Giovanni Righini,et al.  A dynamic programming algorithm for the single-machine scheduling problem with deteriorating processing times , 2006, Electron. Notes Discret. Math..

[12]  T. Ibaraki,et al.  A dynamic programming method for single machine scheduling , 1994 .

[13]  Bo Liu,et al.  An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[14]  Uday Kumar Chakraborty,et al.  Floating-point to integer mapping schemes in differential evolution for permutation flow shop scheduling , 2010, Int. J. Bio Inspired Comput..

[15]  Jian-Bo Yang,et al.  GA-based discrete dynamic programming approach for scheduling in FMS environments , 2001, IEEE Trans. Syst. Man Cybern. Part B.

[16]  Wu Qi-di.  Logical Time-sequenced Particle Swarm Optimization Strategy of Procedure Parameters in Semiconductor Product Line , 2006 .

[17]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

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

[19]  Ling Wang,et al.  A Hybrid Quantum-Inspired Genetic Algorithm for Multiobjective Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[20]  Peter B. Luh,et al.  An effective approach for job-shop scheduling with uncertain processing requirements , 1999, IEEE Trans. Robotics Autom..

[21]  Chung-Yee Lee,et al.  Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint , 1997, Oper. Res. Lett..

[22]  R. C. Leachman,et al.  Stochastic wafer fabrication scheduling , 2003 .

[23]  Li-Pei Wong,et al.  Bee colony optimisation algorithm with big valley landscape exploitation for job shop scheduling problems , 2010, Int. J. Bio Inspired Comput..

[24]  Mohammad Mahdavi Mazdeh,et al.  A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs , 2007, Eur. J. Oper. Res..

[25]  Süleyman Tüfekci,et al.  Dynamic programming solution to the batching problem in just-in-time flow-shops , 2006, Comput. Ind. Eng..

[26]  Habiba Drias,et al.  ACO approach with learning for preemptive scheduling of real-time tasks , 2010, Int. J. Bio Inspired Comput..