Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives
暂无分享,去创建一个
Quan-Ke Pan | Ponnuthurai N. Suganthan | Tay Jin Chua | Tian Xiang Cai | Kai-Zhou Gao | Chin-Soon Chong | P. Suganthan | Q. Pan | T. Chua | K. Gao | C. Chong | T. Cai
[1] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[2] Quan-Ke Pan,et al. Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems , 2011 .
[3] Shengyao Wang,et al. An effective artificial bee colony algorithm for the flexible job-shop scheduling problem , 2012 .
[4] Jing J. Liang,et al. A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem , 2011, Expert Syst. Appl..
[5] Min Liu,et al. An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling , 2012 .
[6] Sheik Meeran,et al. Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..
[7] Peter Brucker,et al. Job-shop scheduling with multi-purpose machines , 1991, Computing.
[8] Quan-Ke Pan,et al. An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems , 2010, Comput. Ind. Eng..
[9] Li-Ning Xing,et al. Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling , 2009, Appl. Soft Comput..
[10] M. Fesanghary,et al. An improved harmony search algorithm for solving optimization problems , 2007, Appl. Math. Comput..
[11] K. Lee,et al. The harmony search heuristic algorithm for discrete structural optimization , 2005 .
[12] P. Suganthan,et al. A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem , 2011 .
[13] Vinícius Amaral Armentano,et al. Tardiness minimization in a flexible job shop: A tabu search approach , 2004, J. Intell. Manuf..
[14] Pierre Borne,et al. Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.
[15] Quan-Ke Pan,et al. Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion , 2011 .
[16] Mehmet Fatih Tasgetiren,et al. Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms , 2010, Expert Syst. Appl..
[17] Jing J. Liang,et al. A Hybrid Harmony Search Algorithm for the no-Wait Flow-shop Scheduling Problems , 2012, Asia Pac. J. Oper. Res..
[18] Zong Woo Geem,et al. Optimal Scheduling of Multiple Dam System Using Harmony Search Algorithm , 2007, IWANN.
[19] Liang Gao,et al. An effective genetic algorithm for the flexible job-shop scheduling problem , 2011, Expert Syst. Appl..
[20] Zhiming Wu,et al. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..
[21] Mitsuo Gen,et al. Genetic Algorithms , 1999, Wiley Encyclopedia of Computer Science and Engineering.
[22] Parviz Fattahi,et al. A HYBRID MULTI OBJECTIVE ALGORITHM FOR FLEXIBLE JOB SHOP SCHEDULING , 2009 .
[23] G. Vilcot,et al. A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem , 2011 .
[24] Mitsuo Gen,et al. A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..
[25] Li-Ning Xing,et al. An efficient search method for multi-objective flexible job shop scheduling problems , 2009, J. Intell. Manuf..
[26] Luca Maria Gambardella,et al. Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .
[27] Stéphane Dauzère-Pérès,et al. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..
[28] Zuobao Wu,et al. Multiagent scheduling method with earliness and tardiness objectives in flexible job shops , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[29] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..
[30] Pierre Borne,et al. Ant systems & Local Search Optimization for flexible Job Shop Scheduling Production , 2007, Int. J. Comput. Commun. Control.
[31] Mahamed G. H. Omran,et al. Global-best harmony search , 2008, Appl. Math. Comput..
[32] F. Pezzella,et al. A genetic algorithm for the Flexible Job-shop Scheduling Problem , 2008, Comput. Oper. Res..
[33] Zong Woo Geem,et al. A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..
[34] Mostafa Zandieh,et al. Integrating simulation and genetic algorithm to schedule a dynamic flexible job shop , 2009, J. Intell. Manuf..
[35] Peigen Li,et al. A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem , 2007, Comput. Oper. Res..
[36] Reha Uzsoy,et al. Benchmarks for shop scheduling problems , 1998, Eur. J. Oper. Res..
[37] Liang Gao,et al. An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem , 2009, Comput. Ind. Eng..
[38] Rajesh Kumar,et al. An Improved Harmony Search algorithm for optimal scheduling of the diesel generators in oil rig platforms , 2011 .
[39] Paolo Brandimarte,et al. Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..