Proceedings of the Korean Institute of Intelligent Systems Conference (한국지능시스템학회:학술대회논문집)

Korean Institute of Intelligent Systems (한국지능시스템학회)
권호 표지

Term-Based Scheduling Languages and their Comparison in View or the Expressivity

  • Kim, Pok-Son (Kookmin University, Department of Mathematics) ;
  • Arne Kutzner (Seokyeong University, Department of E-Business) ;
  • Park, Taehoon (Seokyeong University, Department of E-Business)
  • Published : 2003.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

The logic-based scheduling languages RSV and RCPSV may be used to represent and to solve a new general class of resource-constrained project scheduling with variants. RSV and RCPSV syntactically represent schedul7ing problems as descriptions (activity terms) being similar to concepts in a description logic. Though RSV and RCPSV have a different syntax, they are equal1y expressive. On the other hand, from a complexity point of view RCPSV permits more compact representations than RSV. We argue that the difference may be exponential.

Keywords