A hybrid bio-geography based optimization for permutation flow shop scheduling

[1]  Jiyin Liu,et al.  Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..

[2]  Ling Wang,et al.  An Effective Hybrid Heuristic for Flow Shop Scheduling , 2003 .

[3]  Ping Chen,et al.  An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion , 2009, Comput. Oper. Res..

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Jacques Carlier,et al.  Ordonnancements à contraintes disjonctives , 1978 .

[6]  F. D. Croce,et al.  The two-machine total completion time flow shop problem , 1996 .

[7]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

[8]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

[9]  Lin-Yu Tseng,et al.  A hybrid genetic local search algorithm for the permutation flowshop scheduling problem , 2009, Eur. J. Oper. Res..

[10]  P. K. Chattopadhyay,et al.  Biogeography-Based Optimization for Different Economic Load Dispatch Problems , 2010, IEEE Transactions on Power Systems.

[11]  Yih-Long Chang,et al.  A new heuristic for the n-job, M-machine flow-shop problem , 1991 .

[12]  Dan Simon,et al.  Biogeography-based optimization with blended migration for constrained optimization problems , 2010, GECCO '10.

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

[14]  Hartmut Stadtler,et al.  Supply chain management and advanced planning--basics, overview and challenges , 2005, Eur. J. Oper. Res..

[15]  S. Bansal.  Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound Approach , 1977 .

[16]  Dan Simon,et al.  Biogeography-Based Optimization , 2022 .

[17]  Uday Kumar Chakraborty,et al.  An efficient stochastic hybrid heuristic for flowshop scheduling , 2007, Eng. Appl. Artif. Intell..

[18]  Andreas C. Nearchou,et al.  A novel metaheuristic approach for the flow shop scheduling problem , 2004, Eng. Appl. Artif. Intell..

[19]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[20]  Roberto Tadei,et al.  An improved branch-and-bound algorithm for the two machine total completion time flow shop problem , 2002, Eur. J. Oper. Res..

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

[22]  Sakti Prasad Ghoshal,et al.  Biogeography-based Optimization for Economic Load Dispatch Problems , 2009 .

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

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

[25]  Dan Simon,et al.  Blended biogeography-based optimization for constrained optimization , 2011, Eng. Appl. Artif. Intell..

[26]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[27]  P. K. Chattopadhyay,et al.  Solving complex economic load dispatch problems using biogeography-based optimization , 2010, Expert Syst. Appl..

[28]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[29]  Haiping Ma,et al.  An analysis of the equilibrium of migration models for biogeography-based optimization , 2010, Inf. Sci..

[30]  M. Yamashiro,et al.  Solving flow shop scheduling problems by quantum differential evolutionary algorithm , 2010 .

[31]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[32]  Bassem Jarboui,et al.  An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems , 2009, Comput. Oper. Res..

[33]  Tarek A. El-Mihoub,et al.  Hybrid Genetic Algorithms: A Review , 2006, Eng. Lett..

[34]  C. Rajendran.  Heuristic algorithm for scheduling in a flowshop to minimize total flowtime , 1993 .

[35]  Colin R. Reeves,et al.  Improving the Efficiency of Tabu Search for Machine Sequencing Problems , 1993 .

[36]  Ling Wang,et al.  A hybrid differential evolution method for permutation flow-shop scheduling , 2008 .

[37]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[38]  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).

[39]  Alper Döyen,et al.  A new approach to solve hybrid flow shop scheduling problems by artificial immune system , 2004, Future Gener. Comput. Syst..

[40]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

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

[42]  Xiaoping Li,et al.  Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization , 2009, Eur. J. Oper. Res..

[43]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[44]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .

[45]  Edward F. Stafford,et al.  On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem , 1988 .

[46]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[47]  Hui Li,et al.  A real-coded biogeography-based optimization with mutation , 2010, Appl. Math. Comput..

[48]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[49]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

[50]  Jatinder N. D. Gupta,et al.  Heuristic Algorithms for Multistage Flowshop Scheduling Problem , 1972 .