Native metaheuristics for non-permutation flowshop scheduling

The most general flowshop scheduling problem is also addressed in the literature as non-permutation flowshop (NPFS). Current processors are able to cope with the $$(n!)^{m}$$ combinatorial complexity of NPFS scheduling by metaheuristics. After briefly discussing the requirements for a manufacturing layout to be designed and modeled as non-permutation flowshop, a disjunctive graph (digraph) approach is used to build native solutions. The implementation of an Ant Colony Optimization (ACO) algorithm has been described in detail; it has been shown how the biologically inspired mechanisms produce eligible schedules, as opposed to most metaheuristics approaches, which improve permutation solutions. ACO algorithms are an example of native non-permutation (NNP) solutions of the flowshop scheduling problem, opening a new perspective on building purely native approaches. The proposed NNP-ACO has been assessed over existing native approaches improving most makespan upper bounds of the benchmark problems from Demirkol et al. (1998).

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

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

[3]  Mehmet Mutlu Yenisey,et al.  A multi-objective ant colony system algorithm for flow shop scheduling problem , 2010, Expert Syst. Appl..

[4]  Ghaith Rabadi,et al.  A two-stage Ant Colony optimization algorithm to minimize the makespan on unrelated parallel machines—part II: enhancements and experimentations , 2014, J. Intell. Manuf..

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

[6]  N. Anantharaman,et al.  Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems , 2003 .

[7]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

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

[9]  Jatinder N. D. Gupta,et al.  Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups , 2010 .

[10]  Reha Uzsoy,et al.  Benchmarks for shop scheduling problems , 1998, Eur. J. Oper. Res..

[11]  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..

[12]  Peter T. Cummings,et al.  Flowshop sequencing with non-permutation schedules , 1991 .

[13]  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 .

[14]  Sheik Meeran,et al.  A multi-level hybrid framework applied to the general flow-shop scheduling problem , 2002, Comput. Oper. Res..

[15]  G. Theraulaz,et al.  Inspiration for optimization from social insect behaviour , 2000, Nature.

[16]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

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

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

[19]  Shih-Wei Lin,et al.  Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems , 2009 .

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

[21]  Moacir Godinho Filho,et al.  Literature review regarding Ant Colony Optimization applied to scheduling problems: Guidelines for implementation and directions for future research , 2013, Eng. Appl. Artif. Intell..

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

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

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

[25]  N. Anantharaman,et al.  Generating non-permutation schedules in flowline-based manufacturing sytems with sequence-dependent setup times of jobs: a heuristic approach , 2004 .

[26]  Frank Werner,et al.  Insertion Techniques for the Heuristic Solution of the Job Shop Problem , 1995, Discret. Appl. Math..

[27]  C. Liao,et al.  A performance evaluation of permutation vs. non-permutation schedules in a flowshop , 2006 .

[28]  Chris N. Potts,et al.  Permutation vs. non-permutation flow shop schedules , 1991, Oper. Res. Lett..

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

[30]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

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

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

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

[34]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

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