메뉴 건너뛰기




Volumn , Issue , 2000, Pages 742-747

Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; ITERATIVE METHODS; JOB SHOP SCHEDULING; LOCAL SEARCH (OPTIMIZATION); SCALABILITY;

EID: 29344437801     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (41)

References (18)
  • 13
    • 5244278595 scopus 로고    scopus 로고
    • A Fast Taboo Search Algorithm for the Job Shop Problem
    • Nowicki, E., and Smutnicki, C. 1996. A Fast Taboo Search Algorithm for the Job Shop Problem. Management Science 42:797-813.
    • (1996) Management Science , vol.42 , pp. 797-813
    • Nowicki, E.1    Smutnicki, C.2
  • 14
    • 0030125477 scopus 로고    scopus 로고
    • A Computational Study of Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling
    • Nuijten, W., and Aarts, E. 1996. A Computational Study of Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling. European Journal of Operational Research 90(2):269-284.
    • (1996) European Journal of Operational Research , vol.90 , Issue.2 , pp. 269-284
    • Nuijten, W.1    Aarts, E.2
  • 18
    • 0002292918 scopus 로고
    • Scheduling and Rescheduling with Iterative Repair
    • Zweben, M., and Fox, S. M., eds., Morgan Kaufmann
    • Zweben, M.; Duan, B.; Davis, E.; and Deale, M. 1994. Scheduling and Rescheduling with Iterative Repair. In Zweben, M., and Fox, S. M., eds., Intelligent Scheduling. Morgan Kaufmann.
    • (1994) Intelligent Scheduling
    • Zweben, M.1    Duan, B.2    Davis, E.3    Deale, M.4


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