메뉴 건너뛰기




Volumn 34, Issue 7-8, 2007, Pages 783-789

Research on immune genetic algorithm for solving the job-shop scheduling problem

Author keywords

Immune genetic algorithm; JSSP; Vaccine

Indexed keywords

BENCHMARKING; ENCODING (SYMBOLS); PROBABILITY; PROBLEM SOLVING; SCHEDULING; VACCINES;

EID: 34548636836     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-006-0652-x     Document Type: Article
Times cited : (31)

References (26)
  • 1
    • 0016952078 scopus 로고
    • The complexity of flow-shop and job-shop scheduling
    • 2
    • Garey MR, Johnson DS, Sethi R (1976) The complexity of flow-shop and job-shop scheduling. Math Oper Res 1(2):117-129
    • (1976) Math Oper Res , vol.1 , pp. 117-129
    • Garey, M.R.1    Johnson, D.S.2    Sethi, R.3
  • 2
    • 0033102020 scopus 로고    scopus 로고
    • Deterministic job-shop scheduling: Past, present and future
    • 2
    • Jain AS, Meeran S (1999) Deterministic job-shop scheduling: past, present and future. Eur J Res 113(2):390-434
    • (1999) Eur J Res , vol.113 , pp. 390-434
    • Jain, A.S.1    Meeran, S.2
  • 4
    • 0037269567 scopus 로고    scopus 로고
    • Techniques for the job shop scheduling problem: A survey
    • 1
    • Wang S-F, Zou Y-R (2003) Techniques for the job shop scheduling problem: a survey. Syst Eng Theor Pract 23(1):49-55
    • (2003) Syst Eng Theor Pract , vol.23 , pp. 49-55
    • Wang, S.-F.1    Zou, Y.-R.2
  • 7
    • 34548606567 scopus 로고    scopus 로고
    • A fast taboo search algorithm for solving job shop problem
    • 3
    • Qi H-Y, Huang M, Li R (2005) A fast taboo search algorithm for solving job shop problem. J DaLian Railway Institute 26(3):46-48
    • (2005) J DaLian Railway Institute , vol.26 , pp. 46-48
    • Qi, H.-Y.1    Huang, M.2    Li, R.3
  • 8
    • 33744540562 scopus 로고    scopus 로고
    • Pareto archived simulated annealing for job shop scheduling with multiple objectives
    • 1-2
    • Suresh RK, Mohanasundaram KM (2005) Pareto archived simulated annealing for job shop scheduling with multiple objectives. Int J Adv Manuf Technol 29(1-2):184-196
    • (2005) Int J Adv Manuf Technol , vol.29 , pp. 184-196
    • Suresh, R.K.1    Mohanasundaram, K.M.2
  • 9
    • 22844449336 scopus 로고    scopus 로고
    • Parallel simulated annealing algorithm for solving job-shop scheduling problem
    • 6
    • Wu D-W, Lu T-D, Liu X-B, Meng Y-S (2005) Parallel simulated annealing algorithm for solving job-shop scheduling problem. Comput Integr Manuf Syst 11(6):847-850
    • (2005) Comput Integr Manuf Syst , vol.11 , pp. 847-850
    • Wu, D.-W.1    Lu, T.-D.2    Liu, X.-B.3    Meng, Y.-S.4
  • 10
    • 5144234325 scopus 로고    scopus 로고
    • Bi-directional convergence ACO for job-shop scheduling
    • 7
    • Wang C-Q, Cao Y-F, Dai G-Z (2004) Bi-directional convergence ACO for job-shop scheduling. Comput Integr Manuf Syst 10(7):820-824
    • (2004) Comput Integr Manuf Syst , vol.10 , pp. 820-824
    • Wang, C.-Q.1    Cao, Y.-F.2    Dai, G.-Z.3
  • 12
    • 0034271209 scopus 로고    scopus 로고
    • A novel genetic algorithm based on immunity
    • 5
    • Jiao L, Wang L (2000) A novel genetic algorithm based on immunity. IEEE Trans Syst Man Cybern 30(5):552-561
    • (2000) IEEE Trans Syst Man Cybern , vol.30 , pp. 552-561
    • Jiao, L.1    Wang, L.2
  • 18
    • 0028409149 scopus 로고
    • Adaptive probabilities of crossover and mutation in genetic algorithm
    • 4
    • Srinivas M, Patnaik LM (1994) Adaptive probabilities of crossover and mutation in genetic algorithm. IEEE Trans Syst Man Cybern 24(4):656-667
    • (1994) IEEE Trans Syst Man Cybern , vol.24 , pp. 656-667
    • Srinivas, M.1    Patnaik, L.M.2
  • 22
    • 29244488967 scopus 로고    scopus 로고
    • Metallurgical Industry Press Beijing
    • Yun Q-X (2000) Evolution algorithm. Metallurgical Industry Press, Beijing
    • (2000) Evolution Algorithm
    • Yun, Q.-X.1
  • 24
    • 0035324670 scopus 로고    scopus 로고
    • An effective hybrid optimization strategy for job-shop scheduling problems
    • Wang L, Zheng DZ (2001) An effective hybrid optimization strategy for job-shop scheduling problems. Comput Oper Res 28:585-596
    • (2001) Comput Oper Res , vol.28 , pp. 585-596
    • Wang, L.1    Zheng, D.Z.2
  • 25
    • 0036342025 scopus 로고    scopus 로고
    • A modified genetic algorithm for job shop scheduling
    • Wang L, Zheng DZ (2002) A modified genetic algorithm for job shop scheduling. Int J Adv Manuf Technol 20:72-76
    • (2002) Int J Adv Manuf Technol , vol.20 , pp. 72-76
    • Wang, L.1    Zheng, D.Z.2
  • 26
    • 31844443720 scopus 로고    scopus 로고
    • Improved genetic algorithm for the job-shop scheduling problem
    • 9-10
    • Liu T-K, Tsai J-T, Chou J-H (2006) Improved genetic algorithm for the job-shop scheduling problem. Int J Adv Manuf Technol 27(9-10):1021-1029
    • (2006) Int J Adv Manuf Technol , vol.27 , Issue.9-10 , pp. 1021-1029
    • Liu, T.-K.1    Tsai, J.-T.2    Chou, J.-H.3


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