Floating-point to integer mapping schemes in differential evolution for permutation flow shop scheduling
暂无分享,去创建一个
[1] Ling Wang,et al. Scheduling multi-objective job shops using a memetic algorithm based on differential evolution , 2008 .
[2] Emile H. L. Aarts,et al. Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.
[3] James C. Bean,et al. Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..
[4] Chelliah Sriskandarajah,et al. A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..
[5] David G. Dannenbring,et al. An Evaluation of Flow Shop Sequencing Heuristics , 1977 .
[6] Andrew Lim,et al. Two-machine flow shop problems with a single server , 2006, J. Sched..
[7] Hideo Tanaka,et al. Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .
[8] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.
[9] Andreas C. Nearchou,et al. Differential evolution for sequencing and scheduling optimization , 2006, J. Heuristics.
[10] É. Taillard. Some efficient heuristic methods for the flow shop sequencing problem , 1990 .
[11] Ali Allahverdi,et al. Total flowtime in no-wait flowshops with separated setup times , 1998, Comput. Oper. Res..
[12] Ling Wang,et al. An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..
[13] Rainer Storn,et al. Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..
[14] Uday Kumar Chakraborty,et al. An improved heuristic for permutation flowshop scheduling , 2007, Int. J. Inf. Commun. Technol..
[15] Mohamed Ben-Daya,et al. A tabu search approach for the flow shop scheduling problem , 1998, Eur. J. Oper. Res..
[16] D. Pohoryles,et al. Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .
[17] Chandrasekharan Rajendran,et al. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..
[18] Colin R. Reeves,et al. A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..
[19] Pin Luarn,et al. A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..
[20] Ling Wang,et al. An Effective PSO-Based Hybrid Algorithm for Multiobjective Permutation Flow Shop Scheduling , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.
[21] Anurag Agarwal,et al. Improvement heuristic for the flow-shop scheduling problem: An adaptive-learning approach , 2006, Eur. J. Oper. Res..
[22] Jung Woo Jung,et al. Flowshop-scheduling problems with makespan criterion: a review , 2005 .
[23] Rubén Ruiz,et al. A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..
[24] Masatoshi Sakawa,et al. Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms , 2000, Eur. J. Oper. Res..
[25] Jack Heller,et al. Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects , 1960 .
[26] Alain Guinet,et al. Reduction of job-shop problems to flow-shop problems with precedence constraints , 1998, Eur. J. Oper. Res..
[27] Ling Wang,et al. A hybrid differential evolution method for permutation flow-shop scheduling , 2008 .
[28] C. Rajendran,et al. An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs , 1997 .
[29] 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..
[30] Uday K. Chakraborty,et al. A constructive heuristic for minimizing makespan in no-wait flow shop scheduling , 2009 .
[31] R. Storn,et al. Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .
[32] Uday K. Chakraborty,et al. An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling , 2008 .
[33] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.
[34] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..
[35] Jose M. Framiñan,et al. Approximative procedures for no-wait job shop scheduling , 2003, Oper. Res. Lett..
[36] Uday Kumar Chakraborty,et al. An efficient stochastic hybrid heuristic for flowshop scheduling , 2007, Eng. Appl. Artif. Intell..
[37] Rubén Ruiz,et al. No-wait flowshop with separate setup times to minimize maximum lateness , 2007 .
[38] Hong Zhou,et al. Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times , 2001, Ann. Oper. Res..
[39] Godfrey C. Onwubolu,et al. Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..
[40] Uday K. Chakraborty,et al. An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling , 2009 .
[41] T. Ross. Fuzzy Logic with Engineering Applications , 1994 .
[42] Subhash C. Sarin,et al. Scheduling heuristic for the n-jobm-machine flow shop , 1993 .
[43] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[44] A. S. Spachis,et al. Heuristics for flow-shop scheduling , 1980 .
[45] Stefan Voß,et al. Solving the continuous flow-shop scheduling problem by metaheuristics , 2003, Eur. J. Oper. Res..
[46] Amit Konar,et al. Differential Evolution Using a Neighborhood-Based Mutation Operator , 2009, IEEE Transactions on Evolutionary Computation.
[47] Edy Bertolissi,et al. Heuristic algorithm for scheduling in the no-wait flow-shop , 2000 .
[48] S. Afshin Mansouri,et al. A simulated annealing approach to a bi-criteria sequencing problem in a two-stage supply chain , 2006, Comput. Ind. Eng..
[49] Fawaz S. Al-Anzi,et al. The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time , 2008 .
[50] I. Osman,et al. Simulated annealing for permutation flow-shop scheduling , 1989 .
[51] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[52] Jose M. Framiñan,et al. Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003 , 2004 .