메뉴 건너뛰기




Volumn 31, Issue 5-6, 2006, Pages 580-593

Solving job shop scheduling problems using artificial immune system

Author keywords

Affinity mutation; Artificial immune system; Clonal selection; Job shop scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; IMMUNOLOGY; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING;

EID: 33751194631     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-005-0226-3     Document Type: Article
Times cited : (55)

References (30)
  • 2
    • 0016952078 scopus 로고
    • The complexity of flow shop and job shop scheduling
    • Garey M, et al (1976) The complexity of flow shop and job shop scheduling. Math Oper Res 1:117-129
    • (1976) Math Oper Res , vol.1 , pp. 117-129
    • Garey, M.1
  • 3
    • 0016973040 scopus 로고
    • Finding some essential characteristics of the feasible solutions for a scheduling problem
    • Erschler JF, Roubellat JP, Vernhes (1976) Finding some essential characteristics of the feasible solutions for a scheduling problem. Oper Res 24:774-783
    • (1976) Oper Res , vol.24 , pp. 774-783
    • Erschler, J.F.1    Roubellat, J.P.2    Vernhes3
  • 5
    • 0000165767 scopus 로고
    • An algorithm for solving the job shop problem
    • Carlier J, Pison E (1989) An algorithm for solving the job shop problem. Manage Sci 35:164-176
    • (1989) Manage Sci , vol.35 , pp. 164-176
    • Carlier, J.1    Pison, E.2
  • 6
    • 43949161199 scopus 로고
    • A branch and bound algorithm for job shop problem
    • Bruker P et al (1994) A branch and bound algorithm for job shop problem. Discrete Appl Math 49:107-127
    • (1994) Discrete Appl Math , vol.49 , pp. 107-127
    • Bruker, P.1
  • 7
    • 0030212629 scopus 로고    scopus 로고
    • The job shop scheduling problem: Conventional and new solutions techniques
    • Blazewickz J (1996) The job shop scheduling problem: Conventional and new solutions techniques. Eur J Oper Res pp 931-30
    • (1996) Eur J Oper Res , pp. 931-1030
    • Blazewickz, J.1
  • 8
    • 0033894498 scopus 로고    scopus 로고
    • A tabu search method guided by shifting bottleneck for the job shop scheduling problem
    • Pezzella F, Merelli E (2000) A tabu search method guided by shifting bottleneck for the job shop scheduling problem. Eur J Oper Res 120:297-310
    • (2000) Eur J Oper Res , vol.120 , pp. 297-310
    • Pezzella, F.1    Merelli, E.2
  • 9
    • 0043058211 scopus 로고
    • Guided local search with shifting bottleneck for job shop scheduling
    • GSIA Carnegie Mellon University, Pittsburgh
    • Balas E, Vazacopoulos A (1994) Guided local search with shifting bottleneck for job shop scheduling. Tech Rep Management Science Research Report MSRR-609, GSIA Carnegie Mellon University, Pittsburgh
    • (1994) Tech Rep Management Science Research Report , vol.MSRR-609
    • Balas, E.1    Vazacopoulos, A.2
  • 11
    • 3142656372 scopus 로고    scopus 로고
    • Engineering an immune system
    • Forrest S, Hoffmeyr SA (2000) Engineering an immune system. Graft 4(5):5-9
    • (2000) Graft , vol.4 , Issue.5 , pp. 5-9
    • Forrest, S.1    Hoffmeyr, S.A.2
  • 12
    • 0012021893 scopus 로고    scopus 로고
    • Novelty detection in time series data using ideas from immunology
    • Reno, Nevada, June 1996
    • Dasgupta D, Forrest S (1996) Novelty detection in time series data using ideas from immunology. Proc ISCA'96, Reno, Nevada, June 1996, pp 19-21
    • (1996) Proc ISCA'96 , pp. 19-21
    • Dasgupta, D.1    Forrest, S.2
  • 14
    • 0037856497 scopus 로고    scopus 로고
    • The clonal selection algorithm with engineering applications
    • Las Vegas, 8-12 July 2000
    • De Castro LN, Von Zuben FJ (2000) The clonal selection algorithm with engineering applications. Proc Workshop on GECCO 2000, Las Vegas, 8-12 July 2000, pp 36-37
    • (2000) Proc Workshop on GECCO 2000 , pp. 36-37
    • De Castro, L.N.1    Von Zuben, F.J.2
  • 18
    • 0035452563 scopus 로고    scopus 로고
    • A new adaptive neural network and heuristics hybrid approach for job shop scheduling
    • Yang S, Wang D (2001) A new adaptive neural network and heuristics hybrid approach for job shop scheduling. Comput Oper Res 28:955-971
    • (2001) Comput Oper Res , vol.28 , pp. 955-971
    • Yang, S.1    Wang, D.2
  • 19
    • 3142755746 scopus 로고    scopus 로고
    • A new approach to solve hybrid flow shop scheduling problems by artificial immune system
    • Engin O, Doyen A (2004) A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Future Generation Comput Syst 20:1083-1095
    • (2004) Future Generation Comput Syst , vol.20 , pp. 1083-1095
    • Engin, O.1    Doyen, A.2
  • 21
    • 4444290554 scopus 로고    scopus 로고
    • Learning to detect texture objects by artificial immune approaches
    • Zheng H, Zhang J, Nahavandi S (2004) Learning to detect texture objects by artificial immune approaches. Future Generation Comput Systems 20:1197-1208
    • (2004) Future Generation Comput Systems , vol.20 , pp. 1197-1208
    • Zheng, H.1    Zhang, J.2    Nahavandi, S.3
  • 22
    • 0032685882 scopus 로고    scopus 로고
    • Enhancement of thermal unit commitment using immune algorithms based optimization approaches
    • Huang S (1999) Enhancement of thermal unit commitment using immune algorithms based optimization approaches. Electr Power Energy Syst 21:245-252
    • (1999) Electr Power Energy Syst , vol.21 , pp. 245-252
    • Huang, S.1
  • 23
    • 4444290554 scopus 로고    scopus 로고
    • Learning to detect texture objects by artificial immune approaches
    • Zheng H, Zhang J, Nahavandi S (2004) Learning to detect texture objects by artificial immune approaches. Future Generation Comput Syst 20:1197-1208
    • (2004) Future Generation Comput Syst , vol.20 , pp. 1197-1208
    • Zheng, H.1    Zhang, J.2    Nahavandi, S.3
  • 24
    • 33751191393 scopus 로고    scopus 로고
    • A paradigm for blind IIR equalization using the constant modules criterion and an artificial immune network
    • Attux RRF, et al (2003) A paradigm for blind IIR equalization using the constant modules criterion and an artificial immune network. IEEE XIII Workshop on Neural Networks for Signal Processing, pp 839-849
    • (2003) IEEE XIII Workshop on Neural Networks for Signal Processing , pp. 839-849
    • Attux, R.R.F.1
  • 27
    • 0026126118 scopus 로고
    • A computational study of the job shop scheduling problem
    • Applegate D, Cook W (1991) A computational study of the job shop scheduling problem. ORSA J Comput 3:149-156
    • (1991) ORSA J Comput , vol.3 , pp. 149-156
    • Applegate, D.1    Cook, W.2
  • 28
    • 0023977010 scopus 로고
    • The shifting bottleneck procedure for job shop scheduling
    • Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manage Sci 34:391-401
    • (1988) Manage Sci , vol.34 , pp. 391-401
    • Adams, J.1    Balas, E.2    Zawack, D.3
  • 30
    • 0027201278 scopus 로고
    • Benchmarks for basic scheduling problems
    • Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278-285
    • (1993) Eur J Oper Res , vol.64 , pp. 278-285
    • Taillard, E.1


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