DocumentCode :
2537413
Title :
Scheduling AND/OR precedence constraints jobs to minimize the makespan by mapping from CPM to AND/OR network
Author :
Tao, Wang ; Da-Xin, Liu
Author_Institution :
Sch. of Comput. Sci. & Technol., Harbin Eng. Univ., China
fYear :
2005
fDate :
17-19 Aug. 2005
Firstpage :
169
Lastpage :
172
Abstract :
Scheduling AND/OR precedence constraints jobs to produce a feasible schedule is a well studied problem in real time jobs scheduling field; many approaches and algorithms are presented to solve this problem. However, few of them use the project scheduling method applied in the real time jobs scheduling. In this paper, a new idea of scheduling the AND/OR precedence constraints by a network analysis method CPM is introduced. The minimum makespan of AND/OR precedence constraints jobs is the important performance objective. The AND/OR and CPM models are introduced and used to schedule the jobs with precedence constraints. Moreover, an ES algorithm is presented to solve the problem of scheduling AND/OR precedence constraints to minimize the makespan. The algorithm can compute the job s ES in polynomial time and its capacity is O (na+nolog no+ na).
Keywords :
computational complexity; critical path analysis; minimisation; processor scheduling; real-time systems; AND/OR network; AND/OR precedence constraints jobs; CPM; ES algorithm; network analysis; polynomial time; project scheduling; real time jobs scheduling; Computer applications; Computer networks; Computer science; Concurrent computing; Delay; Polynomials; Processor scheduling; Real time systems; Scheduling algorithm; Stochastic processes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Embedded and Real-Time Computing Systems and Applications, 2005. Proceedings. 11th IEEE International Conference on
ISSN :
1533-2306
Print_ISBN :
0-7695-2346-3
Type :
conf
DOI :
10.1109/RTCSA.2005.89
Filename :
1541074
Link To Document :
بازگشت