Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Home
  • Home
EnglishFrançais
Probability in the Engineering and Informational Sciences Probability in the Engineering and Informational Sciences

Article contents

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.
If you should have access and can't see this content please contact technical support.

References

1.Bruno, J. (1985). On scheduling tasks with exponential service times and in-tree precedence constraints. Ada Informatica 22: 139–148.Google Scholar
2.Chandy, K.M. & Reynolds, P.F. (1975). Scheduling partially ordered tasks with probabilistic execution times. Operating System Review 9: 169–177.CrossRefGoogle 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.CrossRefGoogle 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).CrossRefGoogle 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

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 12 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 16th January 2021. This data will be updated every 24 hours.

2 Cited by
Hostname: page-component-77fc7d77f9-qzt2x Total loading time: 0.617 Render date: 2021-01-16T03:45:44.175Z Query parameters: { "hasAccess": "0", "openAccess": "0", "isLogged": "0", "lang": "en" } Feature Flags last update: Sat Jan 16 2021 02:52:56 GMT+0000 (Coordinated Universal Time) Feature Flags: { "metrics": true, "metricsAbstractViews": false, "peerReview": true, "crossMark": true, "comments": true, "relatedCommentaries": true, "subject": true, "clr": true, "languageSwitch": true, "figures": false, "newCiteModal": false, "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true }

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs
Available formats
×
×

Reply to: Submit a response

Your details

Conflicting interests

Do you have any conflicting interests? *