메뉴 건너뛰기




Volumn 4247 LNCS, Issue , 2006, Pages 158-165

A hybrid discrete particle swarm algorithm for open-shop problems

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; PROBLEM SOLVING; SIMULATED ANNEALING;

EID: 33751353212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper
Times cited : (11)

References (21)
  • 2
    • 47949089702 scopus 로고    scopus 로고
    • Particle swarm optimization algorithm for permutation flowshop sequencing problem
    • Proc. of the 4th International Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS 2004), September 5-8, Brussels, Belgium
    • M. Fatih Tasgetiren, Mehmet Sevkli, Yun-Chia Liang, and Gunes Gencyilmaz: Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem. In: Proc. of the 4th International Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS 2004), LNCS 3172, September 5-8, Brussels, Belgium, (2004) 382-390
    • (2004) LNCS , vol.3172 , pp. 382-390
    • Tasgetiren, M.F.1    Sevkli, M.2    Liang, Y.-C.3    Gencyilmaz, G.4
  • 5
    • 14044268702 scopus 로고    scopus 로고
    • An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
    • Weijun Xia, Zhiming Wu: An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers & Industrial Engineering 48 (2005) 409-425
    • (2005) Computers & Industrial Engineering , vol.48 , pp. 409-425
    • Weijun, X.1    Zhiming, W.2
  • 6
    • 33744757412 scopus 로고    scopus 로고
    • Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
    • Chen Ai-ling, Yang Gen-ke, Wu Zhi-ming: Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University SCIENCE A, 7(4), (2006) 607-614
    • (2006) Journal of Zhejiang University Science A , vol.7 , Issue.4 , pp. 607-614
    • Ai-Ling, C.1    Gen-Ke, Y.2    Zhi-Ming, W.3
  • 7
    • 26844490180 scopus 로고    scopus 로고
    • Discrete Particle Swarm Optimization (DPSO) algorithm for permutation flowshop scheduling to minimize makspan
    • Proc. ICNC 2005
    • K.Rameshkumar, R.K. Suresh, and K.M.Mohanasundaram: Discrete Particle Swarm Optimization (DPSO) Algorithm for Permutation Flowshop Scheduling to Minimize Makspan. In: Proc. ICNC 2005, LNCS 3612, (2005) 572-581
    • (2005) LNCS , vol.3612 , pp. 572-581
    • Rameshkumar, K.1    Suresh, R.K.2    Mohanasundaram, K.M.3
  • 10
    • 0343878108 scopus 로고    scopus 로고
    • Using intelligent backtracking to improve branch-and bound methods: An application to Open-Shop problems
    • Christelle Guret, N. Jussien and C.Prins: Using intelligent backtracking to improve branch-and bound methods: An application to Open-Shop problems. European Journal of Operational Research, 127 (2000) 344-354
    • (2000) European Journal of Operational Research , vol.127 , pp. 344-354
    • Guret, C.1    Jussien, N.2    Prins, C.3
  • 13
    • 84941172199 scopus 로고    scopus 로고
    • Genetic algorithms for solving open shop scheduling problems
    • S. Khuri and S. R. Miryala: Genetic algorithms for solving open shop scheduling problems. Lecture Notes in Computer Science, 1070, (2001) 10-18
    • (2001) Lecture Notes in Computer Science , vol.1070 , pp. 10-18
    • Khuri, S.1    Miryala, S.R.2
  • 14
    • 0003011391 scopus 로고
    • A promising genetic algorithm approach to job-shop scheduling, re-scheduling, and open-shop scheduling problems
    • San Mateo, CA, USA
    • Hsiao-Lan Fang, Peter Ross, and Dave Corne: A promising genetic algorithm approach to job-shop scheduling, re-scheduling, and open-shop scheduling problems. In: Proc. of the 5th International Conference on Genetic Algorithms, San Mateo, CA, USA, (1993) 375-382
    • (1993) Proc. of the 5th International Conference on Genetic Algorithms , pp. 375-382
    • Fang, H.-L.1    Ross, P.2    Corne, D.3
  • 18
    • 26844447786 scopus 로고    scopus 로고
    • Discrete particle swarm optimization, illustrated by the Traveling Salesman Problem
    • Heidelberg, Germany
    • M.Clerc: Discrete particle swarm optimization, illustrated by the Traveling Salesman Problem. In: New Optimization Techniques in Engineering. Heidelberg, Germany, (2004) 219-239
    • (2004) New Optimization Techniques in Engineering , pp. 219-239
    • Clerc, M.1
  • 19
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • S.Kirkpatrick, C.D.Gelatt and M.P.Vecchi: Optimization by simulated annealing. Science, Vol. 220(13), (1983) 671-680
    • (1983) Science , vol.220 , Issue.13 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.D.2    Vecchi, M.P.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.