Hybrid Tabu Search Algorithm for bi-criteria No-idle permutation flow shop scheduling problem

Proceedings of the 2011 Chinese Control and Decision Conference, CCDC 2011

Volumn , Issue , 2011, Pages 1699-1702

  Ren, Wen Juan ^a   Duan, Jun Hua ^a   Zhang, Feng Rong ^a   Han, Hong Yan ^a   Zhang, Min ^a  

^a Liao Cheng University   (China)

Author keywords

Makespan; Multi objective optimization; No idle permutation Flow Shop Scheduling; Tabu Search Algorithm; Total flow time

Indexed keywords

MAKESPAN; MULTI OBJECTIVE; NO-IDLE; TABU SEARCH ALGORITHM; TOTAL FLOWTIME;

LEARNING ALGORITHMS; MACHINE SHOP PRACTICE; MULTIOBJECTIVE OPTIMIZATION; SCHEDULING ALGORITHMS;

TABU SEARCH;

EID: 80052218597     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCDC.2011.5968469     Document Type: Conference Paper

References (10)

1. Kalczynski P J,Kamburowski J, "A heuristic for minimize the makespan in no-idle permutation flow shops", Computers & Industrial Engineering, vol.49,pp.146-154,2005.
2. Baraz D, Mosheiov G, "A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time",European Journal of Operational Research,vol.184,pp. 810-813,2008.
3. Quan-Ke Pan,Ling Wang " No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm ",Internationl Journal of Advanced Manufactory Technology, vol.39,pp.796-807,2008.
4. Quan-Ke Pan,Ling Wang, "A novel differnential evolution algorithm for no-idle permutation flow-shop scheduling problems", European Journal of Industrial Engineering, vol. 2 (3),pp.279-295,2008.
5. Lei Wu, Quan-Ke Pan, "Harmony Search Algorithm for No-idle Flow Shop Scheduling problems", Computer Integrated Manufacturing System, vol. 15(10),pp,1960-1967,2009.
6. Zhang GH, Shao XY, Li PG, Gao L. An effective hybrid swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Computers and Industrial Engineering, 56(4):1309-1318, 2009
7. Kalczynski P J,Kamburowski J, "On the NEH Heuristic for minimizing the Makespan In permutation flowshops ",The International Journal of Management Sciences, vol.35 (1),pp. 53-60,2007.
8. RuizR,MarotoC, "A comprehensive review and evaluation of permutation flowshop heuristics", European Journal of Operational Research, vol.16(5),pp.479-494,2005.
9. Xingye Dong,Houkuan Huang,Ping Chen,"An Improved NEH-based heuristic for the permutation flowshop problem",Computers & Operations Research vol.35,pp.3962 - 3968,2008.
10. Qun-Ke Pan,Ling Wang, Bao-Hua Zhao, "Discrete Particle Swarm Optimization algorithm for No-idle Flow Shop problems", Control and Decision,vol.23 (2),pp.191-194,2008.