메뉴 건너뛰기




Volumn 7, Issue , 2010, Pages 3706-3710

A multi-objective particle swarm optimization for openshop scheduling problems

Author keywords

Multi objective; Open shop; Particle swarm optimization; Scheduling

Indexed keywords


EID: 78149344622     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNC.2010.5583560     Document Type: Conference Paper
Times cited : (2)

References (15)
  • 1
    • 0017012325 scopus 로고
    • Open shop scheduling to minimize finish time
    • Gonzalez T., Sahni S., "Open shop scheduling to minimize finish time," Journal of the ACM, Vol. 23, 1976, pp. 665-79.
    • (1976) Journal of the ACM , vol.23 , pp. 665-679
    • Gonzalez, T.1    Sahni, S.2
  • 2
    • 0032650280 scopus 로고    scopus 로고
    • Applying simulated annealing to the open shop scheduling problem
    • Liaw C.-F., "Applying simulated annealing to the open shop scheduling problem," IIE Transactions, Vol. 31, 1999, pp. 457-65.
    • (1999) IIE Transactions , vol.31 , pp. 457-465
    • Liaw, C.-F.1
  • 3
    • 0033080204 scopus 로고    scopus 로고
    • A tabu search algorithm for the open shop scheduling problem
    • Liaw C.-F., "A tabu search algorithm for the open shop scheduling problem," Computers & Operations Research, Vol.26, 1999, pp. 109-26.
    • (1999) Computers & Operations Research , vol.26 , pp. 109-126
    • Liaw, C.-F.1
  • 4
    • 0034230637 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for the open shop scheduling problem
    • Liaw C.-F., "A hybrid genetic algorithm for the open shop scheduling problem," European Journal of Operational Research, Vol.124, 2000, pp. 28-42.
    • (2000) European Journal of Operational Research , vol.124 , pp. 28-42
    • Liaw, C.-F.1
  • 5
    • 9544220684 scopus 로고    scopus 로고
    • Beam-ACO-Hybridizing ant colony optimization with beam search: An application to open shop scheduling
    • Blum C., "Beam-ACO-Hybridizing ant colony optimization with beam search: an application to open shop scheduling," Computers & Operations Research, Vol. 32, 2005, pp. 1565-91.
    • (2005) Computers & Operations Research , vol.32 , pp. 1565-1591
    • Blum, C.1
  • 6
    • 0009204680 scopus 로고    scopus 로고
    • Competitive genetic algorithms for the open-shop scheduling problem
    • Prins C., "Competitive genetic algorithms for the open-shop scheduling problem," Mathematical Methods of Operations Research, Vol. 52, 2000, pp. 389-411.
    • (2000) Mathematical Methods of Operations Research , vol.52 , pp. 389-411
    • Prins, C.1
  • 8
    • 70350401130 scopus 로고    scopus 로고
    • A new heuristic for open shop total completion time problem
    • Tang L., Bai D., "A new heuristic for open shop total completion time problem," Applied Mathematical Modeling, vol. 34 2010, pp. 735-743.
    • (2010) Applied Mathematical Modeling , vol.34 , pp. 735-743
    • Tang, L.1    Bai, D.2
  • 9
    • 8344270234 scopus 로고    scopus 로고
    • Scheduling preemptive open shops to minimize total tardiness
    • Liaw C.-F., "Scheduling preemptive open shops to minimize total tardiness," European Journal of Operational Research, Vol.162, 2005, pp. 173-183.
    • (2005) European Journal of Operational Research , vol.162 , pp. 173-183
    • Liaw, C.-F.1
  • 12
    • 0000131281 scopus 로고
    • Algorithms for solving production scheduling problems
    • Giffler J, Thompson G.L., "Algorithms for solving production scheduling problems," Operations Research, Vol. 8, 1960, pp. 487-503.
    • (1960) Operations Research , vol.8 , pp. 487-503
    • Giffler, J.1    Thompson, G.L.2
  • 13
    • 30744437401 scopus 로고    scopus 로고
    • Particle swarm optimization for resource-constrained project scheduling
    • Zhang H., Li H., Tam C.M., "Particle swarm optimization for resource-constrained project scheduling," International Journal of Project Management, Vol. 24, 2006, pp. 83-92.
    • (2006) International Journal of Project Management , vol.24 , pp. 83-92
    • Zhang, H.1    Li, H.2    Tam, C.M.3
  • 14
    • 40249116814 scopus 로고    scopus 로고
    • A new particle swarm optimization for the open shop scheduling problem
    • Sha D.Y., Hsu C.-Y., "A new particle swarm optimization for the open shop scheduling problem," Computers & Operations Research, Vol. 35, 2008, pp. 3243-3261.
    • (2008) Computers & Operations Research , vol.35 , pp. 3243-3261
    • Sha, D.Y.1    Hsu, C.-Y.2
  • 15
    • 0033483011 scopus 로고    scopus 로고
    • A new lower bound for the open-shop problem
    • Guéret C., Prins C., "A new lower bound for the open-shop problem," Annals of Operations Research, vol. 92, 1999, pp. 165-183.
    • (1999) Annals of Operations Research , vol.92 , pp. 165-183
    • Guéret, C.1    Prins, C.2


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