Hybrid Genetic Simulated Annealing Algorithm for Improved Flow Shop Scheduling with Makespan Criterion

[1]  P. Chang,et al.  The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem , 2002 .

[2]  M. Sayadi,et al.  A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems , 2010 .

[3]  Minghao Yin,et al.  A hybrid cuckoo search via Lévy flights for the permutation flow shop scheduling problem , 2013 .

[4]  Kannan Govindan,et al.  A hybrid approach for minimizing makespan in permutation flowshop scheduling , 2017 .

[5]  Jian Lin,et al.  An effective hybrid biogeography-based optimization algorithm for the distributed assembly permutation flow-shop scheduling problem , 2016, Comput. Ind. Eng..

[6]  Xiao-Yan Sun,et al.  A discrete artificial bee colony algorithm incorporating differential evolution for the flow-shop scheduling problem with blocking , 2015 .

[7]  Min Liu,et al.  A High Performing Memetic Algorithm for the Flowshop Scheduling Problem With Blocking , 2013, IEEE Transactions on Automation Science and Engineering.

[8]  J.-B. Wang,et al.  Flow-shop scheduling with a learning effect , 2005, J. Oper. Res. Soc..

[9]  Lin-Yu Tseng,et al.  A hybrid genetic algorithm for no-wait flowshop scheduling problem , 2010 .

[10]  Songqiao Tao,et al.  An algorithm for weighted sub-graph matching based on gradient flows , 2016, Inf. Sci..

[11]  Xin-She Yang,et al.  Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan , 2014, Appl. Soft Comput..

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

[13]  Adriana Giret,et al.  A genetic algorithm for energy-efficiency in job-shop scheduling , 2016 .

[14]  Christos Koulamas,et al.  The three-stage assembly flowshop scheduling problem , 2001, Comput. Oper. Res..

[15]  Xinyu Shao,et al.  An effective hybrid teaching-learning-based optimization algorithm for permutation flow shop scheduling problem , 2014, Adv. Eng. Softw..

[16]  Frank Werner,et al.  Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop , 2008, Math. Comput. Model..

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

[18]  Adriana Giret,et al.  Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm , 2013 .

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

[20]  Erhan Kozan,et al.  Scheduling a flow-shop with combined buffer conditions , 2009 .

[21]  Kun Zheng,et al.  An Improved Genetic-Simulated Annealing Algorithm Based on a Hormone Modulation Mechanism for a Flexible Flow-Shop Scheduling Problem , 2013 .

[22]  Liang Gao,et al.  A hybrid backtracking search algorithm for permutation flow-shop scheduling problem minimizing makespan and energy consumption , 2015, 2017 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM).

[23]  Mehmet Mutlu Yenisey,et al.  Ant colony optimization for multi-objective flow shop scheduling problem , 2008, Comput. Ind. Eng..

[24]  Liang Gao,et al.  An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem , 2009, Comput. Ind. Eng..

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

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

[27]  Shengyao Wang,et al.  A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem , 2016 .

[28]  Robert L. Burdett,et al.  Evolutionary algorithms for flowshop sequencing with non‐unique jobs , 2000 .

[29]  Raymond Chiong,et al.  An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem , 2015, Appl. Soft Comput..

[30]  Xingsheng Gu,et al.  A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion , 2012, Comput. Oper. Res..

[31]  Stefan Voß,et al.  Solving the continuous flow-shop scheduling problem by metaheuristics , 2003, Eur. J. Oper. Res..

[32]  D. Davendra,et al.  Scheduling flow shops with blocking using a discrete self-organising migrating algorithm , 2013 .

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

[34]  Quan-Ke Pan,et al.  Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization , 2013 .

[35]  P. Shahabudeen,et al.  An improved genetic algorithm for the flowshop scheduling problem , 2009 .

[36]  Quan-Ke Pan,et al.  An improved migrating birds optimization for an integrated lot-streaming flow shop scheduling problem , 2018, Swarm Evol. Comput..

[37]  Mehmet Fatih Tasgetiren,et al.  Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion , 2017, Comput. Oper. Res..

[38]  Anurag Agarwal,et al.  Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach , 2006, Eur. J. Oper. Res..

[39]  V. Chandra Prakash,et al.  Evolutionary Hybrid Particle Swarm Optimization Algorithm for Solving NP-Hard No-Wait Flow Shop Scheduling Problems , 2017, Algorithms.

[40]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem , 2011, Inf. Sci..

[41]  Jason Chao-Hsien Pan,et al.  A hybrid genetic algorithm for no-wait job shop scheduling problems , 2009, Expert Syst. Appl..

[42]  Farhat Fnaiech,et al.  A Suitable Initialization Procedure for Speeding a Neural Network Job-Shop Scheduling , 2011, IEEE Transactions on Industrial Electronics.

[43]  Débora P. Ronconi,et al.  A note on constructive heuristics for the flowshop problem with blocking , 2004 .

[44]  Kannan Govindan,et al.  Rule based heuristic approach for minimizing total flow time in permutation flow shop scheduling , 2015 .

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

[46]  Edy Bertolissi,et al.  Heuristic algorithm for scheduling in the no-wait flow-shop , 2000 .

[47]  Erhan Kozan,et al.  A sequencing approach for creating new train timetables , 2010, OR Spectr..

[48]  Bassem Jarboui,et al.  Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem , 2016, J. Comput. Des. Eng..