Nonpermutation flow line scheduling by ant colony optimization

Abstract A flow line is a conventional manufacturing system where all jobs must be processed on all machines with the same operation sequence. Line buffers allow nonpermutation flowshop scheduling and job sequences to be changed on different machines. A mixed-integer linear programming model for nonpermutation flowshop scheduling and the buffer requirement along with manufacturing implication is proposed. Ant colony optimization based heuristic is evaluated against Taillard's (1993) well-known flowshop benchmark instances, with 20 to 500 jobs to be processed on 5 to 20 machines (stages). Computation experiments show that the proposed algorithm is incumbent to the state-of-the-art ant colony optimization for flowshop with higher job to machine ratios, using the makespan as the optimization criterion.

[1]  Michele Lanzetta,et al.  Native metaheuristics for non-permutation flowshop scheduling , 2014, J. Intell. Manuf..

[2]  Manoj Kumar Tiwari,et al.  Scheduling of flexible manufacturing systems: An ant colony optimization approach , 2003 .

[3]  Michele Lanzetta,et al.  , M . : Heuristics for Scheduling a Two-stage Hybrid Flow Shop with Parallel Batching Machines : an Application on Hospital Sterilization Plant , 2013 .

[4]  Barbara Webb,et al.  Swarm Intelligence: From Natural to Artificial Systems , 2002, Connect. Sci..

[5]  Gerrit Färber,et al.  BENCHMARK RESULTS OF A GENETIC ALGORITHM FOR NON-PERMUTATION FLOWSHOPS USING CONSTRAINED BUFFERS* , 2006 .

[6]  Thomas Stützle,et al.  An Ant Approach to the Flow Shop Problem , 1998 .

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

[8]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[9]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[10]  Seyed Jafar Sadjadi,et al.  An Ant Colony Algorithm for the Flowshop Scheduling Problem , 2008 .

[11]  Peter Brucker,et al.  Flow-shop problems with intermediate buffers , 2003, OR Spectr..

[12]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

[13]  S. Q. Li,et al.  Intelligent selective disassembly using the ant colony algorithm , 2003, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[14]  Christian Blum,et al.  An Ant Colony Optimization Algorithm for Shop Scheduling Problems , 2004, J. Math. Model. Algorithms.

[15]  Jose M. Framiñan,et al.  Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective , 2010, Comput. Oper. Res..

[16]  Michele Lanzetta,et al.  Heuristics for scheduling a two-stage hybrid flow shop with parallel batching machines: application at a hospital sterilisation plant , 2013 .

[17]  Donald E. Grierson,et al.  Comparison among five evolutionary-based optimization algorithms , 2005, Adv. Eng. Informatics.

[18]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[19]  Carlos Cotta,et al.  Solving the tool switching problem with memetic algorithms , 2011, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[20]  Michele Lanzetta,et al.  Dynamic set-up rules for hybrid flow shop scheduling with parallel batching machines , 2014 .

[21]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[22]  Michele Lanzetta,et al.  Scheduling flow lines with buffers by ant colony digraph , 2013, Expert Syst. Appl..

[23]  Shih-Wei Lin,et al.  Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems , 2007 .

[24]  Sofiane Achiche,et al.  Genetic fuzzy modeling of user perception of three-dimensional shapes , 2011, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.