Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem
暂无分享,去创建一个
[1] Bassem Jarboui,et al. A hybrid genetic algorithm for solving no-wait flowshop scheduling problems , 2011 .
[2] Chelliah Sriskandarajah,et al. A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..
[3] Michael Pinedo,et al. Sequencing in an Assembly Line with Blocking to Minimize Cycle Time , 1989, Oper. Res..
[4] Tapan P. Bagchi,et al. Minimizing makespan in a blocking flowshop using genetic algorithms , 2001 .
[5] Lin-Yu Tseng,et al. A hybrid genetic algorithm for no-wait flowshop scheduling problem , 2010 .
[6] M. F. Tasgetiren,et al. A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .
[7] É. Taillard. Some efficient heuristic methods for the flow shop sequencing problem , 1990 .
[8] Manuel Mateo,et al. Different behaviour of a double branch-and-bound algorithm on Fm|prmu|Cmax and Fm|block|Cmax problems , 2007, Comput. Oper. Res..
[9] Abdelwaheb Rebai,et al. An Estimation of Distribution Algorithm for Minimizing the Makespan in Blocking Flowshop Scheduling Problems , 2009 .
[10] Ping Chen,et al. An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion , 2009, Comput. Oper. Res..
[11] Débora P. Ronconi,et al. Lower bounding schemes for flowshops with blocking in-process , 2001, J. Oper. Res. Soc..
[12] Thomas Stützle,et al. Iterated local search for the quadratic assignment problem , 2006, Eur. J. Oper. Res..
[13] D. Y. Sha,et al. A new particle swarm optimization for the open shop scheduling problem , 2008, Comput. Oper. Res..
[14] Chelliah Sriskandarajah,et al. Minimizing Cycle Time in a Blocking Flowshop , 2000, Oper. Res..
[15] Józef Grabowski,et al. Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..
[16] Bassem Jarboui,et al. A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems , 2008, Appl. Math. Comput..
[17] J. Grabowski,et al. The permutation flow shop problem with blocking. A tabu search approach , 2007 .
[18] Bassem Jarboui,et al. Combinatorial particle swarm optimization (CPSO) for partitional clustering problem , 2007, Appl. Math. Comput..
[19] Eugeniusz Nowicki,et al. The permutation flow shop with buffers: A tabu search approach , 1999, Eur. J. Oper. Res..
[20] Mehmet Fatih Tasgetiren,et al. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..
[21] Paolo Dell'Olmo,et al. Coloring graphs by iterated local search traversing feasible and infeasible solutions , 2008, Discret. Appl. Math..
[22] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[23] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[24] E. Nowicki,et al. A fast tabu search algorithm for the permutation flow-shop problem , 1996 .
[25] Ponnuthurai N. Suganthan,et al. A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems , 2010, Comput. Oper. Res..
[26] U Aickelin,et al. Handbook of metaheuristics (International series in operations research and management science) , 2005 .
[27] Erhan Kozan,et al. Scheduling a flow-shop with combined buffer conditions , 2009 .
[28] 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..
[29] Toshihide Ibaraki,et al. An iterated local search algorithm for the vehicle routing problem with convex time penalty functions , 2008, Discret. Appl. Math..
[30] Débora P. Ronconi,et al. A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking , 2005, Ann. Oper. Res..
[31] Bassem Jarboui,et al. A combinatorial particle swarm optimisation for solving permutation flowshop problems , 2008, Comput. Ind. Eng..
[32] James Kennedy,et al. Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.
[33] Débora P. Ronconi,et al. A note on constructive heuristics for the flowshop problem with blocking , 2004 .
[34] Rainer Leisten,et al. Flowshop sequencing problems with limited buffer storage , 1990 .
[35] Bassem Jarboui,et al. A GRASP based on DE to solve single machine scheduling problem with SDST , 2012, Comput. Optim. Appl..
[36] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[37] Helena Ramalhinho Dias Lourenço,et al. Iterated Local Search , 2001, Handbook of Metaheuristics.
[38] Richard S. H. Mah,et al. An implicit enumeration scheme for the flowshop problem with no intermediate storage , 1981 .