현재 위치
Home
A Job-Shop Scheduling Model of Software Development Planning for Constraint-based Local Search
-
- 발행기관
- 보안공학연구지원센터(IJSEIA) 바로가기
-
- 간행물
- International Journal of Software Engineering and Its Applications 바로가기
-
- 통권
- Vol.4 No.4 (2010.11)바로가기
-
- 페이지
- pp.1-16
-
- 저자
-
- 언어
- 영어(ENG)
-
- URL
- https://www.earticle.net/Article/A147956
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
원문정보
초록
- 영어
- Software development planning usually does not take any advantage of planning and scheduling techniques involving reasoning about time and resources, which are typical in the manufacturing area. This paper proposes a constraint-based model for the Job Shop Scheduling Problem to be solved using local search techniques. The model can be used to represent a multiple software process planning problem when the different (activities of) projects compete for limited staff. The main aspects of the model are: the use of integer variables which represent the relative order of the operations to be scheduled, and two global constraints, alldifferent (all the variable values are forced to be different from the others) and increasing (the variable values are forced to be greater than the previous ones in the sequence), for ensuring feasibility. The AllDifferent and Increasing constraints enforce the conjunction of one binary constraint, the not-equal constraint and the greater constraint respectively, for every pair of variables. By analyzing the set of all relations at the same time, both global constraints offer greater filtering power, enhancing the constraint model and the efficiency in the resolution of the problem. An interesting property of the model is that cycle detection in the schedules is implicit in the satisfaction of the constraints. In order to test the proposed model, a parameterized local search algorithm has been used, with a neighborhood similar to the Nowicki and Smutnicki one, which has been adapted in order to be suitable for the proposed model.
목차
Abstract
1. Introduction
2. Problem Definition
3. Constraint Programming
4. Our Proposal
4.1. The CSP Model
4.2. Cycle Detection
4.3. Neighborhoods
4.4. The Parameterized Algorithm
5. Experimental Results
6. Conclusions and Future Work
References
키워드
job shop scheduling local search constraint satisfaction problems software development processes.저자
간행물 정보
발행기관
-
- 발행기관명
- 보안공학연구지원센터(IJSEIA) [Science & Engineering Research Support Center, Republic of Korea(IJSEIA)]
- 설립연도
- 2006
- 분야
- 공학>컴퓨터학
- 소개
- 1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업
간행물
-
- 간행물명
- International Journal of Software Engineering and Its Applications
- 간기
- 월간
- pISSN
- 1738-9984
- 수록기간
- 2008~2016
- 등재여부
- SCOPUS
- 십진분류
- KDC 505 DDC 605
이 권호 내 다른 논문 / International Journal of Software Engineering and Its Applications Vol.4 No.4
피인용수 : 0건 (자료제공 : 네이버학술정보)
함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.
출처 : 네이버학술정보
0개의 논문이 장바구니에 담겼습니다.