A particle swarm optimization algorithm for flexible job shop scheduling problem

The classical job shop scheduling problem (JSP) is the most popular machine scheduling model in practice and is well known as NP-hard. The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed. Flexible job shop scheduling problem (FJSP) is an extension of the JSP, which allows an operation to be processed by any machine from a given set. Since FJSP requires an additional decision of machine allocation during scheduling, therefore it is much more complex problem than JSP. To solve such NP-hard problems, heuristic approaches are commonly preferred over the traditional mathematical techniques. This paper proposes a particle swarm optimization (PSO) based heuristic for solving the FJSP for minimum makespan time criterion. The performance of the proposed PSO is evaluated by comparing its results with the results obtained using ILOG Solver, a constraint-programming tool. The comparison of the results proves the effectiveness of the proposed PSO for solving FJSP instances.

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

[2]  Peter Brucker,et al.  Job-shop scheduling with multi-purpose machines , 1991, Computing.

[3]  Christoph S. Thomalla.  Job shop scheduling with alternative process plans , 2001 .

[4]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

[5]  Nhu Binh Ho,et al.  An effective architecture for learning and evolving flexible job-shop schedules , 2007, Eur. J. Oper. Res..

[6]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[7]  Johann L. Hurink,et al.  Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .

[8]  Pierre Borne,et al.  Evolution programs for job-shop scheduling , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[9]  N. Jawahar,et al.  Scheduling job shop associated with multiple routings with genetic and ant colony heuristics , 2009 .

[10]  W. E. Wilhelm,et al.  Effectiveness of alternate operations in a flexible manufacturing system , 1985 .

[11]  J. C. Tay,et al.  Applying the Clonal Selection Principle to Find Flexible Job-Shop Schedules , 2005, ICARIS.

[12]  Mitsuo Gen,et al.  A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems , 2007, Comput. Ind. Eng..

[13]  Richard A. Wysk,et al.  Using a CATS database for alternative machine loading , 1984 .

[14]  Pierre Borne,et al.  Assignment and Scheduling in Flexible Job-Shops by Hierarchical Optimization , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[15]  Ajith Abraham,et al.  Variable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-Shop Scheduling Problems , 2006, SEAL.

[16]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[17]  Jun Tang,et al.  An improved particle swarm optimization for multi-objective flexible job-shop scheduling problem , 2007, 2007 IEEE International Conference on Grey Systems and Intelligent Services.

[18]  D. Y. Sha,et al.  A hybrid particle swarm optimization for job shop scheduling problem , 2006, Comput. Ind. Eng..

[19]  Pierre Borne,et al.  Ant systems & Local Search Optimization for flexible Job Shop Scheduling Production , 2007, Int. J. Comput. Commun. Control.

[20]  N.M. Najid,et al.  A modified simulated annealing method for flexible job shop scheduling problem , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[21]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[22]  Nhu Binh Ho,et al.  Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems , 2008, Comput. Ind. Eng..

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

[24]  Andrea Rossi,et al.  Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method , 2007 .

[25]  Luca Maria Gambardella,et al.  Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .

[26]  Fawaz S. Al-Anzi,et al.  A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application , 2006, Comput. Oper. Res..