DocumentCode
3180256
Title
Constraint-based scheduling: a recursive approach
Author
Wang, Jiaxin ; Gaspart, Pierre
Author_Institution
Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China
fYear
1992
fDate
12-14 May 1992
Firstpage
1077
Abstract
The authors introduce the idea of constraint-based scheduling and consider some constraints as a good factor in scheduling. The idea is used to develop a novel scheduling method. A schedule problem is used to present the method. The parallel-serial plan (PSP) is defined. A recursive approach to find the best scheduling for a PSP is outlined. The complexity of the algorithm is discussed, and the algorithm is extended for the scheduling of a plan
Keywords
computational complexity; scheduling; constraint-based scheduling; parallel-serial plan; recursive approach; Availability; Computer science; Costs; Paper technology; Processor scheduling; Production planning; Production systems; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Robotics and Automation, 1992. Proceedings., 1992 IEEE International Conference on
Conference_Location
Nice
Print_ISBN
0-8186-2720-4
Type
conf
DOI
10.1109/ROBOT.1992.220205
Filename
220205
Link To Document