메뉴 건너뛰기




Volumn 3, Issue 4, 2011, Pages 79-88

A hybrid particle swarm optimization algorithm for job-shop scheduling problem

Author keywords

Job shop scheduling problem; Makespan; Particle swarm optimization; Simulated annealing

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; GLOBAL SEARCH CAPABILITY; HYBRID PARTICLE SWARM OPTIMIZATION ALGORITHM; HYBRID PARTICLES; JOB SHOP SCHEDULING PROBLEMS; LOCAL OPTIMA; LOCAL SEARCH; MAKESPAN; NEIGHBORHOOD SEARCH ALGORITHMS; PARTICLE SWARM; POLYNOMIAL-TIME; SA ALGORITHM;

EID: 79961037764     PISSN: 20058039     EISSN: None     Source Type: Journal    
DOI: 10.4156/ijact.vol3.issue4.9     Document Type: Article
Times cited : (18)

References (16)
  • 2
    • 20444394714 scopus 로고    scopus 로고
    • A new neighborhood search algorithm for Job-shop scheduling Problem
    • Lei Wang, Wenqi Huang, "A new neighborhood search algorithm for Job-shop scheduling Problem", Computer Journal, vol.28, no.5, pp. 809-815, 2005.
    • (2005) Computer Journal , vol.28 , Issue.5 , pp. 809-815
    • Wang, L.1    Huang, W.2
  • 3
    • 78651547643 scopus 로고    scopus 로고
    • Dynamic integrated algorithm for production scheduling based on iterative search
    • Song Cunli, Liu Xiaobing, Wang Wei, Huang Ming, Dynamic integrated algorithm for production scheduling based on iterative search, Journal of Convergence Information Technology, vol. 5, no. 10, pp. 159-166, 2010.
    • (2010) Journal of Convergence Information Technology , vol.5 , Issue.10 , pp. 159-166
    • Cunli, S.1    Xiaobing, L.2    Wei, W.3    Ming, H.4
  • 4
    • 79960116001 scopus 로고    scopus 로고
    • Solving job shop scheduling problem using genetic algorithm with penalty function
    • Sun Liang, Cheng Xiaochun, Liang Yanchun, "Solving job shop scheduling problem using genetic algorithm with penalty function", Journal of Next Generation Information Technology, vol.1, no.1, pp. 65-77, 2010.
    • (2010) Journal of Next Generation Information Technology , vol.1 , Issue.1 , pp. 65-77
    • Liang, S.1    Xiaochun, C.2    Yanchun, L.3
  • 5
    • 33744526968 scopus 로고    scopus 로고
    • A hybrid particle swarm optimization approach for the job-shop scheduling problem
    • Xia Wenjun, Wu Zhiming, "A hybrid particle swarm optimization approach for the job-shop scheduling problem", Internal Journal Advanced Manufacture Technology, vol.29,no.1, pp.360-366, 2006.
    • (2006) Internal Journal Advanced Manufacture Technology , vol.29 , Issue.1 , pp. 360-366
    • Wenjun, X.1    Zhiming, W.2
  • 6
    • 33750728125 scopus 로고    scopus 로고
    • A particle swarm optimization-based algorithm for job-shop scheduling problem
    • Ge Hongwei, Liang Yanchun, "A particle swarm optimization-based algorithm for job-shop scheduling problem", Journal of Computational Methods, vol.2, no.1, pp.419-430, 2005.
    • (2005) Journal of Computational Methods , vol.2 , Issue.1 , pp. 419-430
    • Ge, H.1    Yanchun, L.2
  • 7
    • 34247151984 scopus 로고    scopus 로고
    • A hybrid scheduling algorithm based on particle swarm optimization and variable neighborhood search
    • Quanke Pan, Wang Hongwen, Zhu Jianying, Zhao Baohua, "A hybrid scheduling algorithm based on particle swarm optimization and variable neighborhood search", Chinese journal of Computer Integrated Manufacturing System, vol.13,no.1,pp.323-328, 2007.
    • (2007) Chinese Journal of Computer Integrated Manufacturing System , vol.13 , Issue.1 , pp. 323-328
    • Pan, Q.1    Hongwen, W.2    Jianying, Z.3    Baohua, Z.4
  • 8
    • 0026461248 scopus 로고
    • Job shop scheduling by simulated annealing
    • Van Laarhoven, &/x&&namegr type=editor&&name&&sname&Peter&/sname&&x& &/x&&fname&J.M.&/fname&&/name&&x&, &/x&&name&&sname&Aarts Emile&/sname&&x& &/x&&fname&H.L.&/fname&&/name&&x&, &/x&&name&&fname&Lenstra Jan&/fname&&x& &/x&&sname&Karel&/sname&&/name&&/namegr&, Job shop scheduling by simulated annealing. Operational Research, vol.40, No.1, pp.113-125, 1992.
    • (1992) Operational Research , vol.40 , Issue.1 , pp. 113-125
    • Laarhoven, V.1
  • 9
    • 0030212629 scopus 로고    scopus 로고
    • The job shop scheduling problem: Conventional and new solution techniques
    • Blazewicz Jacek, Domschke Wolfqang, Pesch Erwin, "The job shop scheduling problem: conventional and new solution techniques", European Journal of Operational Research, vol.93,no.1, pp.1-33, 1996.
    • (1996) European Journal of Operational Research , vol.93 , Issue.1 , pp. 1-33
    • Jacek, B.1    Wolfqang, D.2    Erwin, P.3
  • 10
    • 34047181443 scopus 로고    scopus 로고
    • A tabu search algorithm with a new neighborhood structure for the job shop scheduling
    • Zhang Chaoyong, Li PeiGen, Guan Zailin, Yuan Qing, "A tabu search algorithm with a new neighborhood structure for the job shop scheduling", Computers and Operational Research, vol.34, no.1, pp.3229-3242, 2007.
    • (2007) Computers and Operational Research , vol.34 , Issue.1 , pp. 3229-3242
    • Chaoyong, Z.1    Li, P.2    Zailin, G.3    Qing, Y.4
  • 11
    • 34250074609 scopus 로고
    • Applying tabu search to the job-shop scheduling problem
    • Dell'Amico Mauro, Trubian Macro, "Applying tabu search to the job-shop scheduling problem", Ann Operational Research, vol.41, no.14, pp.231-252, 1993.
    • (1993) Ann Operational Research , vol.41 , Issue.14 , pp. 231-252
    • Mauro, D.1    Macro, T.2
  • 12
    • 5244278595 scopus 로고    scopus 로고
    • A fast taboo search algorithm for the job-shop problem
    • Nowicki Euqeniusz, Smutnicki Czeslaw, "A fast taboo search algorithm for the job-shop problem", Management Science, vol.42, No.6, pp.797-813, 1996.
    • (1996) Management Science , vol.42 , Issue.6 , pp. 797-813
    • Euqeniusz, N.1    Czeslaw, S.2
  • 13
    • 0033894498 scopus 로고    scopus 로고
    • A tabu search method guided by shifting bottleneck for job shop scheduling problem
    • Pezzella Ferdinando, Merelli Emanuela, "A tabu search method guided by shifting bottleneck for job shop scheduling problem", European Journal of Operational Research, vol.120, no.2, pp.297-310, 2000.
    • (2000) European Journal of Operational Research , vol.120 , Issue.2 , pp. 297-310
    • Ferdinando, P.1    Emanuela, M.2
  • 16
    • 55149108060 scopus 로고    scopus 로고
    • A filter-and-fan approach to the job shop scheduling problem
    • Rego César, Duarte Renato, A filter-and-fan approach to the job shop scheduling problem", European Journal of Operational Research, vol.194, no.3, pp.650-662, 2009.
    • (2009) European Journal of Operational Research , vol.194 , Issue.3 , pp. 650-662
    • César, R.1    Renato, D.2


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