A Term-based Language for Resource-Constrained Project Scheduling and its Complexity Analysis
- Authors
- Kutzner, Arne; Kim, Pok-Son
- Issue Date
- Mar-2012
- Publisher
- 한국지능시스템학회
- Keywords
- Scheduling problem; description logics; complexity theory
- Citation
- International Journal of Fuzzy Logic and Intelligent systems, v.12, no.1, pp.20 - 28
- Indexed
- KCI
- Journal Title
- International Journal of Fuzzy Logic and Intelligent systems
- Volume
- 12
- Number
- 1
- Start Page
- 20
- End Page
- 28
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/166185
- DOI
- 10.5391/IJFIS.2012.12.1.20
- ISSN
- 1598-2645
- Abstract
- We define a language RS, a subclass of the scheduling language RSV (resource constrained project scheduling with variant processes). RS involves the determination of the starting times for ground activities of a project satisfying precedence and resource constraints, in order to minimize the total project duration. In RS ground activities and two structural symbols (operators) ‘seq’ and ‘pll’ are used to construct activity-terms representing scheduling problems.
We consider three different variants for formalizing the RS-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the problem RS is NP-complete. Further we show that the optimizing variant (or number variant) of theRS-problem is computable in polynomial time iff the decision variant is computable in polynomial time.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 정보시스템학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/166185)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.