메뉴 건너뛰기




Volumn 3, Issue , 1999, Pages

Genetic algorithm approach to an optimal scheduling problem for a large-scale complex manufacturing system

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC OPERATORS; OPTIMAL SCHEDULING PROBLEM; REAL OPERATION DATA;

EID: 0033349815     PISSN: 08843627     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (7)

References (10)
  • 8
    • 0000892122 scopus 로고
    • Parallel taboo search techniques for the job shop scheduling problem
    • E.D. Taillard, "Parallel Taboo Search Techniques for the Job Shop Scheduling Problem", ORSA Jour, on Computing, Vol.6, No.2, 1994, pp.108-117.
    • (1994) ORSA Jour, on Computing , vol.6 , Issue.2 , pp. 108-117
    • Taillard, E.D.1
  • 9
    • 0000887937 scopus 로고    scopus 로고
    • Comparison of two genetic algorithms in solving tough job shop scheduling problems
    • G. Shi, H. lima and N. Sannomiya, "Comparison of Two Genetic Algorithms in Solving Tough Job Shop Scheduling Problems", Trans. IEE of Japan, Vol.ll7-C, No.7, 1997, pp.856-864.
    • (1997) Trans. IEE of Japan , vol.117 C , Issue.7 , pp. 856-864
    • Shi, G.1    Lima, H.2    Sannomiya, N.3
  • 10
    • 84879600969 scopus 로고    scopus 로고
    • Genetic algorithm approach to a scheduling problem for a metal mold assembly process
    • in Japanese
    • K. Ashizawa, H. lima, N. Sannomiya and K. Suzuki and Y. Kobayashi, "Genetic Algorithm Approach to a Scheduling Problem for a Metal Mold Assembly Process", Trans. ISCIE, Vol.12, No.l, 1999, pp.27-35 (in Japanese).
    • (1999) Trans. ISCIE , vol.12 , Issue.1 , pp. 27-35
    • Ashizawa, K.1    Lima, H.2    Sannomiya, N.3    Suzuki, K.4    Kobayashi, Y.5


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