This Article 
 Bibliographic References 
 Add to: 
Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
March 1990 (vol. 16 no. 3)
pp. 360-369

An algorithm that finds an optimal schedule on a single processor for a given set of processes is presented. Each process starts executing after its release time and completes its computation before its deadline and a given set of precedence relations and exclusion relations defined on ordered pairs of process segments are satisfied. This algorithm can be applied to the important and previously unsolved problem of automated pre-run-time scheduling of processes with arbitrary precedence and exclusion in hard-real-time systems.

[1] J. Carlier, "Probleme a une machine," Institute de Programmation, Univ. Paris VI, manuscript, 1980.
[2] E. G. Coffman, Jr.,Computer and Jobshop Scheduling Theory. New York: Wiley-Interscience, 1976.
[3] S. R. Faulk and D. L. Parnas, "On synchronization in hard-real-time systems,"Commun. ACMvol. 31, no. 3, Mar. 1988.
[4] M. R. Garey and D. S. Johnson, "Scheduling tasks with nonuniform deadlines on two processors,"J. ACM, vol. 23, no. 3, July 1976.
[5] M. R. Garey and D. S. Johnson, "Two-processor scheduling with start-times and deadlines,"SIAM J. Comput., vol. 6, Sept. 1977.
[6] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[7] M. R. Garey, D. S. Johnson, B. B. Simons, and R. E. Tarjan, "Scheduling unit-time tasks with arbitrary release times and deadlines,"SIAM J. Comput., vol. 10, May 1981.
[8] M. J. Gonzales, "Deterministic processor scheduling,"ACM Comput. Surveys, vol. 9, no. 3, Sept. 1977.
[9] D. Gunsfield, "Bounds for naive multiple machine scheduling with release times and deadlines,"J. Algorithms, vol. 5, 1984.
[10] E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, "Recent developments in deterministic sequencing and scheduling: A survey," inProc. NATO Advanced Study attd Research Institute on Theoretical Approaches to Scheduling Problems, Durham, England, July 1981; also inDeterministic and Stochastic Scheduling, M. A. H. Dempsteret al., Eds. Dordrecht, The Netherlands: D. Reidel.
[11] C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard real-time environment,"J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[12] G. K. Manacher, "Production and stabilization of real-time task schedules,"J. Ass. Comput. Mach., vol. 14, July 1967.
[13] C. Martel, "Preemptive scheduling with release times, deadlines, and due times,"J. ACM, vol. 29, no. 3, pp. 812-829, July 1982.
[14] G. McMahon and M. Florian, "On scheduling with ready time and due dates to minimize maximum lateness,"Oper. Res., vol. 23, 1975.
[15] A. K. Mok and M. L. Detouzos, "Multiprocessor scheduling in a hard real-time environment," inProc. 7th IEEE Texas Conf. Computing Systems, Nov. 1978.
[16] A. K. Mok, "Fundamental design problems of distributed systems for the hard-real-time environment," Ph.D. dissertation, Dept. Elec. Eng. Comput. Sci., Massachusetts Inst. Technol., Cambridge, MA, May 1983.
[17] A. K. Mok, "The design of real-time programming systems based on process models," inProc. IEEE Real-Time Systems Symp., Dec. 1984.
[18] B. Simons, "Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines,"SIAM J. Comput., vol. 12, May 1983.
[19] W. Zhao, K. Ramamritham, and J. A. Stankovic, "Preemptive scheduling under time and resource constraints,"IEEE Trans. Comput., Aug. 1987.

Index Terms:
optimal schedule; single processor; release time; precedence relations; exclusion relations; ordered pairs; process segments; automated pre-run-time scheduling; arbitrary precedence; hard-real-time systems; optimisation; scheduling; search problems.
J. Xu, D.L. Parnas, "Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations," IEEE Transactions on Software Engineering, vol. 16, no. 3, pp. 360-369, March 1990, doi:10.1109/32.48943
Usage of this product signifies your acceptance of the Terms of Use.