Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates

Abstract This paper is concerned with the problem of scheduling preemptive tasks subject to precedence constraints in order to minimize the maximum lateness and the makespan. The number of available parallel processors is allowed to vary in time. It is shown that when an earliest due date first algorithm provides an optimal nonpreemptive schedule for unit-execution-time (UET) tasks, the preemptive priority scheduling algorithm, referred to as smallest laxity first, provides an optimal preemptive schedule for real-execution-time (RET) tasks. When the objective is to minimize the makespan, we get the same kind of result between highest level first schedules solving nonpreemptive tasks with UET and the longest remaining path first schedule for the corresponding preemptive scheduling problem with RET tasks. These results are applied to four specific profile scheduling problems and new optimality results are obtained.

[1]  Edward G. Coffman,et al.  Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems , 1970, JACM.

[2]  David S. Johnson,et al.  Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness , 1977, Math. Oper. Res..

[3]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[4]  Manfred K. Warmuth,et al.  Profile Scheduling of Opposing Forests and Level Orders , 1985 .

[5]  Edward G. Coffman,et al.  Optimal Preemptive Scheduling on Two-Processor Systems , 1969, IEEE Transactions on Computers.

[6]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[7]  David S. Johnson,et al.  Scheduling Opposing Forests , 1983 .

[8]  Danny Dolev,et al.  Scheduling Precedence Graphs of Bounded Height , 1984, J. Algorithms.

[9]  Éric Sanlaville.  Conception et analyse d'algorithmes de liste en ordonnancement preemptif , 1992 .

[10]  Zhen Liu,et al.  Stochastic Scheduling with Variable Profile and Precedence Constraints , 1997, SIAM J. Comput..

[11]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[12]  Danny Dolev,et al.  Scheduling Flat Graphs , 1985, SIAM J. Comput..

[13]  C SIAMJ..  STOCHASTIC SCHEDULING WITH VARIABLE PROFILE AND PRECEDENCE CONSTRAINTS , 1997 .

[14]  Günter Schmidt,et al.  Scheduling Independent Tasks with Deadlines on Semi-identical Processors , 1988 .

[15]  Kevin Mahon,et al.  Deterministic and Stochastic Scheduling , 1983 .

[16]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .