메뉴 건너뛰기




Volumn 3, Issue , 2007, Pages 715-719

A hybrid algorithm based on particle swarm optimization and simulated annealing for job shop scheduling

Author keywords

[No Author keywords available]

Indexed keywords

GLOBAL OPTIMIZATION; JOB ANALYSIS; PROBLEM SOLVING; SIMULATED ANNEALING;

EID: 38049085312     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNC.2007.44     Document Type: Conference Paper
Times cited : (46)

References (16)
  • 1
    • 3042773342 scopus 로고    scopus 로고
    • The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm
    • C. Akkan and S. Karabati, "The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm", European Journal of Operational Research, (2004), 159(2): 420-429.
    • (2004) European Journal of Operational Research , vol.159 , Issue.2 , pp. 420-429
    • Akkan, C.1    Karabati, S.2
  • 2
    • 0036848723 scopus 로고    scopus 로고
    • A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
    • T. Lorigeon, "A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint," Journal of the Operational Research Society, (2002), 53(11): 1239-1246.
    • (2002) Journal of the Operational Research Society , vol.53 , Issue.11 , pp. 1239-1246
    • Lorigeon, T.1
  • 4
    • 2642529311 scopus 로고    scopus 로고
    • An improved shifting bottleneck procedure for the job shop scheduling problem
    • W.Q. Huang and A.H. Yin, "An improved shifting bottleneck procedure for the job shop scheduling problem", Computers & Operations Research, (2004), 31(12): 2093-2110.
    • (2004) Computers & Operations Research , vol.31 , Issue.12 , pp. 2093-2110
    • Huang, W.Q.1    Yin, A.H.2
  • 5
    • 0038238721 scopus 로고    scopus 로고
    • An alternative framework to Lagrangian relaxation approach for job shop scheduling
    • H.X. Chen and P.B. Luh, "An alternative framework to Lagrangian relaxation approach for job shop scheduling", European Journal of Operational Research, (2003), 149(3): 499-512.
    • (2003) European Journal of Operational Research , vol.149 , Issue.3 , pp. 499-512
    • Chen, H.X.1    Luh, P.B.2
  • 6
    • 0037302910 scopus 로고    scopus 로고
    • Problem difficulty for tabu search in job-shop scheduling
    • J.P. Watson and J.C. Beck, "Problem difficulty for tabu search in job-shop scheduling", Artificial intelligence, (2003): 143(2): 189-217.
    • (2003) Artificial intelligence , vol.143 , Issue.2 , pp. 189-217
    • Watson, J.P.1    Beck, J.C.2
  • 7
    • 26944476629 scopus 로고    scopus 로고
    • A fuzzy genetic algorithm for real-world job shop scheduling
    • C. Fayad and S. Petrovic, "A fuzzy genetic algorithm for real-world job shop scheduling", Lecture Notes in Computer Science, (2005), 3533: 524-533.
    • (2005) Lecture Notes in Computer Science , vol.3533 , pp. 524-533
    • Fayad, C.1    Petrovic, S.2
  • 8
    • 0033078591 scopus 로고    scopus 로고
    • Some new results on simulated annealing applied to the job shop scheduling problem
    • M. Kolonko, "Some new results on simulated annealing applied to the job shop scheduling problem", European Journal of Operational Research, (1999), 113(1): 123-136.
    • (1999) European Journal of Operational Research , vol.113 , Issue.1 , pp. 123-136
    • Kolonko, M.1
  • 9
    • 33744526968 scopus 로고    scopus 로고
    • A hybrid particle swarm optimization approach for the job-shop scheduling problem
    • W.J. Xia and Z.M. Wu, "A hybrid particle swarm optimization approach for the job-shop scheduling problem" International Journal of Advanced Manufacturing Technology, (2006), 29(3-4): 360-366.
    • (2006) International Journal of Advanced Manufacturing Technology , vol.29 , Issue.3-4 , pp. 360-366
    • Xia, W.J.1    Wu, Z.M.2
  • 12
    • 56449107505 scopus 로고
    • OR-Library: Distributing Test Problems by Electronic Mail
    • J.E. Beasley, "OR-Library: Distributing Test Problems by Electronic Mail", Journal of the Operations Research Society, (1990), 41(11): 1069-1072.
    • (1990) Journal of the Operations Research Society , vol.41 , Issue.11 , pp. 1069-1072
    • Beasley, J.E.1
  • 14
    • 3543085004 scopus 로고    scopus 로고
    • Local search genetic algorithms for the job shop scheduling problem
    • B.M. Ombuki and M. Ventresca, "Local search genetic algorithms for the job shop scheduling problem", Applied Intelligence, (2004), 21(1): 99-109.
    • (2004) Applied Intelligence , vol.21 , Issue.1 , pp. 99-109
    • Ombuki, B.M.1    Ventresca, M.2
  • 15
    • 0037379102 scopus 로고    scopus 로고
    • Parallel GRASP with path-relinking for job shop scheduling
    • R.M. Aiex, S. Binato and M.G.C. Resende, "Parallel GRASP with path-relinking for job shop scheduling", Parallel Computing, (2003), 29(4): 393-430.
    • (2003) Parallel Computing , vol.29 , Issue.4 , pp. 393-430
    • Aiex, R.M.1    Binato, S.2    Resende, M.G.C.3


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