메뉴 건너뛰기




Volumn 110, Issue , 2004, Pages 677-681

Assessing the bias of classical planning strategies on makespan-optimizing scheduling

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL PLANNING; LOOSELY COUPLED; MAKESPAN; PLANNING AND SCHEDULING INTEGRATIONS; PLANNING STRATEGIES; SCHEDULING PROBLEM;

EID: 85017366945     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper
Times cited : (3)

References (13)
  • 2
    • 0031074857 scopus 로고    scopus 로고
    • Fast planning through planning graph analysis
    • A.L. Blum and M.L. Furst, Fast Planning Through Planning Graph Analysis, Artificial Intelligence, 281-300, (1997).
    • (1997) Artificial Intelligence , pp. 281-300
    • Blum, A.L.1    Furst, M.L.2
  • 4
    • 84949940148 scopus 로고    scopus 로고
    • A constraint-based architecture for flexible support to activity scheduling
    • A. Cesta, G. Cortellessa, A. Oddi, N. Policella, and A. Susi, A Constraint-Based Architecture for Flexible Support to Activity Scheduling, in LNAI 2175, (2001).
    • (2001) LNAI , vol.2175
    • Cesta, A.1    Cortellessa, G.2    Oddi, A.3    Policella, N.4    Susi, A.5
  • 6
    • 0036182335 scopus 로고    scopus 로고
    • A constrained-based method for project scheduling with time windows
    • A. Cesta, A. Oddi, and S.F. Smith, A Constrained-Based Method for Project Scheduling with Time Windows, Journal of Heuristics, 8(1), 109-135, (2002).
    • (2002) Journal of Heuristics , vol.8 , Issue.1 , pp. 109-135
    • Cesta, A.1    Oddi, A.2    Smith, S.F.3
  • 9
    • 0036377352 scopus 로고    scopus 로고
    • The FF planning system: Fast plan generation through heuristic search
    • J. Hoffmann and B. Nebel, The FF Planning System: Fast Plan Generation Through Heuristic Search, Journal of Artificial Intelligence Research, 14, 253-302, (2001).
    • (2001) Journal of Artificial Intelligence Research , vol.14 , pp. 253-302
    • Hoffmann, J.1    Nebel, B.2
  • 11
    • 0010361812 scopus 로고    scopus 로고
    • Unifying SAT-based and graph-based planning
    • Washington, DC, June 14-16, ed. Jack Minker, College Park, Maryland, (1999). Computer Science Department, University of Maryland
    • H. Kautz and B. Selman, Unifying SAT-Based and Graph-Based Planning, in Workshop on Logic-Based Artificial Intelligence, Washington, DC, June 14-16, 1999, ed., Jack Minker, College Park, Maryland, (1999). Computer Science Department, University of Maryland.
    • (1999) Workshop on Logic-Based Artificial Intelligence
    • Kautz, H.1    Selman, B.2
  • 12
    • 0039310873 scopus 로고
    • HSTS: Integrating planning and scheduling
    • M.Zweben and M.S.Fox (Ed.), Morgan Kauffmann
    • N. Muscettola, HSTS: Integrating planning and scheduling, In M.Zweben and M.S.Fox (Ed.) Intelligent Scheduling, Morgan Kauffmann, (1994).
    • (1994) Intelligent Scheduling
    • Muscettola, N.1
  • 13
    • 1642506021 scopus 로고    scopus 로고
    • Real plan: Decoupling causal and resource reasoning in planning
    • B. Srivastava, Real Plan: Decoupling Causal and Resource Reasoning in Planning, in AAAI/IAAI, pp. 812-818, (2000).
    • (2000) AAAI/IAAI , pp. 812-818
    • Srivastava, B.1


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