A hybrid genetic algorithm for solving no-wait flowshop scheduling problems
暂无分享,去创建一个
[1] Jack Heller,et al. Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects , 1960 .
[2] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[3] Maurice Queyranne,et al. The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[6] David E. Goldberg,et al. Alleles, loci and the traveling salesman problem , 1985 .
[7] Lawrence Davis,et al. Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.
[8] John J. Grefenstette,et al. Genetic algorithms and their applications , 1987 .
[9] D. J. Smith,et al. A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.
[10] J. David Schaffer,et al. Proceedings of the third international conference on Genetic algorithms , 1989 .
[11] Gilbert Syswerda,et al. Uniform Crossover in Genetic Algorithms , 1989, ICGA.
[12] D. Chaudhuri,et al. Heuristic algorithms for continuous flow-shop problem , 1990 .
[13] Emanuel Falkenauer,et al. A genetic algorithm for job shop , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[14] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[15] C. Rajendran,et al. Heuristic algorithms for scheduling in the no-wait flowshop , 1993 .
[16] Chandrasekharan Rajendran,et al. A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .
[17] Mitsuo Gen,et al. Solving job-shop scheduling problems by genetic algorithm , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.
[18] Isao Ono,et al. An Efficient Genetic Algorithm for Job Shop Scheduling Problems , 1995, International Conference on Genetic Algorithms.
[19] Colin R. Reeves,et al. A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..
[20] Chelliah Sriskandarajah,et al. A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..
[21] Chuen-Lung Chen,et al. Genetic algorithms applied to the continuous flow shop problem , 1996 .
[22] Hideo Tanaka,et al. Genetic algorithms for flowshop scheduling problems , 1996 .
[23] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[24] Ali Allahverdi,et al. Total flowtime in no-wait flowshops with separated setup times , 1998, Comput. Oper. Res..
[25] Mitsuo Gen,et al. Genetic algorithms and engineering optimization , 1999 .
[26] Tariq A. Aldowaisan. A new heuristic and dominance relations for no-wait flowshops with setups , 2001, Comput. Oper. Res..
[27] Pierre Hansen,et al. Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..
[28] Jose M. Framiñan,et al. Production , Manufacturing and Logistics Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation , 2002 .
[29] Ali Allahverdi,et al. New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..
[30] Jose M. Framiñan,et al. Approximative procedures for no-wait job shop scheduling , 2003, Oper. Res. Lett..
[31] Stefan Voß,et al. Solving the continuous flow-shop scheduling problem by metaheuristics , 2003, Eur. J. Oper. Res..
[32] Tariq A. Aldowaisan,et al. NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME , 2004 .
[33] S. Shyu,et al. Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time , 2004, Comput. Ind. Eng..
[34] Józef Grabowski,et al. Some local search algorithms for no-wait flow-shop problem with makespan criterion , 2005, Comput. Oper. Res..
[35] S. N. Sivanandam,et al. Introduction to genetic algorithms , 2007 .
[36] Chelliah Sriskandarajah,et al. A review of TSP based approaches for flowshop scheduling , 2006, Eur. J. Oper. Res..
[37] Rubén Ruiz,et al. TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .
[38] Ling Wang,et al. An effective hybrid particle swarm optimization for no-wait flow shop scheduling , 2007 .
[39] Ching-Jong Liao,et al. A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date , 2007, Comput. Ind. Eng..
[40] Marcelo Seido Nagano,et al. Evaluating the performance for makespan minimisation in no-wait flowshop sequencing , 2008 .
[41] Mehmet Fatih Tasgetiren,et al. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..
[42] Malgorzata Sterna,et al. Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date , 2008, Comput. Oper. Res..
[43] Xiaoping Li,et al. Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization , 2009, Eur. J. Oper. Res..