메뉴 건너뛰기




Volumn 1416, Issue , 1998, Pages 46-55

Generic csp techniques for the job-shop problem

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY; EXPERT SYSTEMS; OPTIMIZATION;

EID: 35248835390     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64574-8_390     Document Type: Conference Paper
Times cited : (4)

References (13)
  • 4
    • 0019067870 scopus 로고
    • Increasing tree search efficiency for constraint satisfaction problems
    • Haralick R. and Elliot G.: Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, 14, (1980) 263-313.
    • (1980) Artificial Intelligence , vol.14 , pp. 263-313
    • Haralick, R.1    Elliot, G.2
  • 10
    • 0029332976 scopus 로고
    • Backtracking techniques for the job shop scheduling constraint satisfaction problem
    • Sadeh N., Sycara K., and Xiong Y.: Backtracking techniques for the job shop scheduling constraint satisfaction problem, Artificial Intelligence, 76, (1995) 455-480.
    • (1995) Artificial Intelligence , vol.76 , pp. 455-480
    • Sadeh, N.1    Sycara, K.2    Xiong, Y.3
  • 11
    • 0030246423 scopus 로고    scopus 로고
    • Variable and value ordering for the job shop constraint satisfaction problem
    • Sadeh N. and Fox M.: Variable and value ordering for the job shop constraint satisfaction problem, Artificial Intelligence, 86, (1996) 1-41.
    • (1996) Artificial Intelligence , vol.86 , pp. 1-41
    • Sadeh, N.1    Fox, M.2


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