Journal of applied mathematics & informatics
- Volume 20 Issue 1_2
- /
- Pages.181-195
- /
- 2006
- /
- 2734-1194(pISSN)
- /
- 2234-8417(eISSN)
COMPLEXITY OF THE SCHEDULING LANGUAGE RSV
- KIM POK-SON (Department of Mathematics, Kookmin University) ;
- KUTZNER ARNE (Department of E-Business, Seokyeong University) ;
- PARK TAEHOON (Department of Mathematics, Kookmin University)
- Published : 2006.01.01
Abstract
Resource-constrained project scheduling problems with variant processes can be represented and solved using a logic-based terminological language called RSV (resource constrained project scheduling with variant processes). We consider three different variants for formalizing the RSV-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the RSV- problem is NP-complete. Further we show that the optimizing variant (or number variant) of the RSV-problem is computable in polynomial time iff. the decision variant is computable in polynomial time.