Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-27T07:29:06.207Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs

Published online by Cambridge University Press:  27 July 2009

Zhen Liu  and
Rhonda Righter
Zhen Liu
Affiliation:
INRIA, Centre Sophia Antipolis, 2004 Route des Lucioles B.P. 93, 06902 Sophia-Antipolis, France
Rhonda Righter
Affiliation:
Department of Decision and Information Sciences, Santa Clara University, Santa Clara, California 95053
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider preemptive and nonpreemptive scheduling of partially ordered tasks on parallel processors, where the precedence relations have an intervalorder, an in-forest, or a uniform out-forest structure. Processing times of tasks are random variables with an increasing in likelihood ratio distribution in the nonpreemptive case and an exponential distribution in the preemptive case. We consider a general cost that is a function of time and of the uncompleted tasks and show that the most successors (MS) policy stochastically minimizes the cost function when it satisfies certain agreeability conditions. A consequence is that the MS policy stochastically minimizes makespan, weighted flowtime, and the weighted number of late jobs.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 11 , Issue 1 , January 1997 , pp. 79 - 93
Copyright
Copyright © Cambridge University Press 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Bruno, J. (1985). On scheduling tasks with exponential service times and in-tree precedence constraints. Ada Informatica 22: 139–148.CrossRefGoogle Scholar
2.Chandy, K.M. & Reynolds, P.F. (1975). Scheduling partially ordered tasks with probabilistic execution times. Operating System Review 9: 169–177.Google Scholar
3.Coffman, E.G. Jr & Liu, Z. (1992). On the optimal stochastic scheduling of out-forests. Operations Research 40: S67–S75.CrossRefGoogle Scholar
4.Frostig, E. (1988). A stochastic scheduling problem with intree precedence constraints. Operations Research 36: 937–943.Google Scholar
5.Kulkarni, V.G. & Chimento, P.F. Jr (1992). Optimal scheduling of exponential tasks with intree precedence constraints on two parallel processors subject to failure and repair. Operations Research 40: S263–S271.CrossRefGoogle Scholar
6.Liu, Z. & Sanlaville, E. (1997). Stochastical scheduling with variable profile and precedence constraints. SIAM Journal on Computing 26(1).Google Scholar
7.Papadimitriou, C.H. & Tsitsiklis, J.N. (1987). On stochastic scheduling with in-tree precedence constraints. SIAM Journal on Computing 16: 1–6.CrossRefGoogle Scholar
8.Papadimitriou, C.H. & Yannakakis, M. (1979). Scheduling interval-ordered tasks. SIAM Journal on Computing 8: 405–409.CrossRefGoogle Scholar
9.Pinedo, M. & Weiss, G. (1985). Scheduling jobs with exponentially distributed processing times and intree precedence constraints on two parallel machines. Operations Research 33: 1381–1388.CrossRefGoogle Scholar
10.Righter, R. (1994). Scheduling. In Shaked, M. & Shanthikumar, J.G. (eds.), Stochastic orders. New York: Academic Press, pp. 381–432.Google Scholar
11.Ross, S.M. (1983). Stochastic processes. New York: Wiley.Google Scholar