Abstract
We study a single-machine stochastic scheduling problem with n jobs, in which each job has a random processing time and a general stochastic cost function which may include a random due date and weight. The processing times are exponentially distributed, whereas the stochastic cost functions and the due dates may follow any distributions. The objective is to minimize the expected sum of the cost functions. We prove that a sequence in an order based on the product of the rate of processing time with the expected cost function is optimal, and under certain conditions, a sequence with the weighted shortest expected processing time first (WSEPT) structure is optimal. We show that this generalizes previous known results to more general situations. Examples of applications to practical problems are also discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P.C. Bagga K.R. Kalra (1981) ArticleTitleSingle machine scheduling problem with quadratic functions of completion times - a modified approach Journal of Information and Optimization Sciences 2 103–108
O.J. Boxma F.G. Forst (1986) ArticleTitleMinimizing the expected weighted number of tardy jobs in stochastic flow shops Operations Research Letters. 5 119–126
X. Cai X. Zhou (2000) Asymmetric earliness and tardiness scheduling with exponential processing times on an unreliable machine. Annals of Operations Research 98 313–331
C. Derman G. Lieberman S. Ross (1978) ArticleTitleA renewal decision problem Management Science 24 554–561
K.D. Glazebrook (1979) Scheduling tasks withexponential service times on parallel processors.Journal of Applied Probability 16 658–689
T. Kampke (1989) ArticleTitleOptimal scheduling of jobs with exponential service times on identical parallel processors Operations Research 37 126–133
M. Pinedo (1983) ArticleTitleStochastic scheduling with release dates and due dates Operations Research 31 559–572
M. Pinedo (2002) Scheduling: Theory, Algorithms, and Systems EditionNumber2 Prentice Hall Upper Saddle River, NJ
M.H. Rothkopf (1966) ArticleTitleScheduling with random service times Management Science 12 437–447
R. Righter (1994) Scheduling M. Shacked J.G. Shanthikumar (Eds) Stochastic Orders and Their Applications Academic Press Boston 381–428
S.C. Sarin E. Erel G. Steiner (1991) ArticleTitleSequencing jobs on a single machine with a common due date and stochastic processing times European Journal of Operational Research 51 287–302
G. Weiss M. Pinedo (1980) ArticleTitleScheduling tasks with exponential services times on non-identical processors to minimize various cost functions Journal of Applied Probability 17 187–202
Author information
Authors and Affiliations
Additional information
This work was partially supported by the Research Grants Council of Hong Kong under Earmarked Grants No. CUHK4418/99E and No. PolyU 5081/00E.
Rights and permissions
About this article
Cite this article
Cai, X., Zhou, X. Single-Machine Scheduling with Exponential Processing Times and General Stochastic Cost Functions. J Glob Optim 31, 317–332 (2005). https://doi.org/10.1007/s10898-004-5702-z
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10898-004-5702-z