Skip to main content Accessibility help
×
Home

Scheduling jobs on non-identical IFR processors to minimize general cost functions

Published online by Cambridge University Press:  01 July 2016

Rhonda Righter
Affiliation:
Santa Clara University
Susan H. Xu
Affiliation:
Pennsylvania State University

Abstract

We consider the problem of scheduling n jobs non-preemptively on m parallel, non-identical processors to minimize a weighted expected cost function of job completion times, where the weights are associated with the jobs. The cost function is assumed to be increasing and concave but otherwise arbitrary. Processing times are IFR with different distributions for different processors. Jobs may be processed on any processor and there are no precedences. We show that the optimal policy orders the jobs in decreasing order of their weights and then uses the individually optimal policy for each job. In other words, processors are offered to jobs in order, and each job considers its own expected cost function for its completion time to decide whether to accept or reject a processor. Therefore, the optimal policy does not depend on the weights of the jobs except through their order. Special cases of our objective function are weighted expected flowtime, weighted discounted expected flowtime, and weighted expected number of tardy jobs.

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1991 

Access options

Get access to the full version of this content by using one of the access options below.

References

Agrawala, A. K., Coffman, E. G. Jr., Garey, M. R. and Tripathi, S. K. (1984) A stochastic optimal algorithm minimizing exponential flow times on uniform processors. IEEE Trans. Computers 33, 351356.CrossRefGoogle Scholar
Barlow, R. E. and Proschan, F. (1975) Statistical Theory of Reliability and Life Testing. Holt, Rinehart and Winston, New York.Google Scholar
Coffman, E. G. Jr., Flatto, L., Garey, M. R. and Weber, R. R. (1987) Minimizing expected makespans on uniform processor systems. Adv. Appl. Prob. 19, 177201.CrossRefGoogle Scholar
Courcoubetis, C. A. and Reiman, M. I. (1988) Optimal dynamic allocation of heterogeneous servers under the condition of total overload: The discounted case. Preprint.Google Scholar
Derman, C., Lieberman, G. J. and Ross, S. M. (1980) On the optimal assignment of servers and a repairman. J. Appl. Prob. 17, 577581.CrossRefGoogle Scholar
Glazebrook, K. D. (1979) Scheduling tasks with exponential service times on parallel processors. J. Appl. Prob. 16, 685689.CrossRefGoogle Scholar
Hardy, G. H., Littlewood, J. E. and Pólya, G. (1934) Inequalities. Cambridge University Press.Google ScholarPubMed
Kämpke, T. (1987a) On the optimality of static priority policies in stochastic scheduling on parallel machines. J. Appl. Prob. 24, 430448.CrossRefGoogle Scholar
Kämpke, T. (1987b) Necessary optimality conditions for priority policies in stochastic weighted flowtime scheduling problems. Adv. Appl. Prob. 19, 749750.CrossRefGoogle Scholar
Kumar, P. and Walrand, J. (1985) Individually optimal routing on parallel systems J. Appl. Prob. 22, 989995.CrossRefGoogle Scholar
Larsen, R. L. and Agrawala, A. K. (1983) Control of a heterogeneous two-server exponential queueing system. IEEE Trans. Software Eng. 9, 522526.CrossRefGoogle Scholar
Lin, W. and Kumar, P. R. (1984) Optimal control of a queueing system with two heterogeneous servers. IEEE Trans. Autom. Control 29, 696703.CrossRefGoogle Scholar
Nelson, R. and Towsley, D. (1987) Approximating the meantime in system in a multiple-server queue that uses threshold scheduling. Operat. Res. 35, 419427.CrossRefGoogle Scholar
Pinedo, M. and Weiss, G. (1979) Scheduling of stochastic tasks on two parallel processors. Naval Res. Logist. Quart. 26, 527535.CrossRefGoogle Scholar
Righter, R. (1988) Job scheduling to minimize expected weighted flowtime on uniform processors. Syst. Control Lett. 10, 211216.CrossRefGoogle Scholar
Righter, R. (1990) Stochastically maximizing the number of successes in a sequential assignment problem. J. Appl. Prob. 27, 351364.CrossRefGoogle Scholar
Righter, R. and Xu, S. H. (1991) Scheduling jobs on heterogeneous processors Ann. Operat. Res. 29, 587602.CrossRefGoogle Scholar
Rosberg, Z. and Makowski, S. (1990) Optimal routing to parallel heterogeneous servers—small arrival rates. IEEE Trans. Autom. Control 35, 789796.CrossRefGoogle Scholar
Ross, S. (1983) Introduction to Stochastic Dynamic Programming. Academic Press, New York.Google Scholar
Viniotis, I. and Ephremides, A. (1988) Extension of the optimality of the threshold policy in heterogeneous multiserver queueing systems. IEEE Trans. Autom. Control 33, 104109.CrossRefGoogle Scholar
Walrand, J. (1984) A note on ‘Optimal control of a queueing system with two heterogeneous servers’. Syst. Control Lett. 4, 131134.CrossRefGoogle Scholar
Weber, R. R. (1982) Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan or flowtime. J. Appl. Prob. 19, 167182.Google Scholar
Weber, R., Varaiya, P. and Walrand, J. (1986) Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime. J Appl. Prob. 23, 841847.CrossRefGoogle Scholar
Weiss, G. and Pinedo, M. (1980) Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions. J. Appl. Prob. 17, 187202.CrossRefGoogle Scholar
Xu, S. H. (1991a) Socially and individually optimal routing of stochastic jobs in parallel processors systems. Operat. Res. 39.Google Scholar
Xu, S. H. (1991b) Minimizing expected makespans of multi priority classes of jobs on uniform processors. Operat. Res. Lett. Google Scholar
Xu, S. H. (1991c) Stochastically minimizing total delay of jobs subject to random deadlines. Prob. Eng. Inf. Sci. To appear.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 - 20th January 2021. This data will be updated every 24 hours.

Hostname: page-component-76cb886bbf-m9qpn Total loading time: 0.619 Render date: 2021-01-20T14:08:32.878Z Query parameters: { "hasAccess": "0", "openAccess": "0", "isLogged": "0", "lang": "en" } Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false }

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.

Scheduling jobs on non-identical IFR processors to minimize general cost functions
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.

Scheduling jobs on non-identical IFR processors to minimize general cost functions
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.

Scheduling jobs on non-identical IFR processors to minimize general cost functions
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *