Abstract
In this paper we research the problem in which the objective is to minimize the sum of squared deviations of job expected completion times from the due date, and the job processing times are stochastic. In the problem the machine is subject to stochastic breakdowns and all jobs are preempt-repeat. In order to show that the replacing ESSD by SSDE is reasonable, we discuss difference between ESSD function and SSDE function. We first give an express of the expected completion times for both cases without resampling and with resampling. Then we show that the optimal sequence of the problem V-shaped with respect to expected occupying time. A dynamic programming algorithm based on the V-shape property of the optimal sequence is suggested. The time complexity of the algorithm is pseudopolynomial.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Eilon and I.G. Chowdhury,Minimizing waiting variance in the single machine problem, Management Science, 23, 567–575, 1977.
S.M. Ross,Stochastic processes, Wiley, Yew York, 1983.
K. D. Glazebrook,Scheduling stochastic jobs on a single machine subject to breakdowns, Naval Res. Logist., 31, 251–264, 1984.
U. Bagchi, R.S. Sullivan, and Y.L. Chang,Minimizing mean squared deviation of completion times about a common due date, Management Science, 33, 894–906, 1987.
J.R. Birge, J.B.G. Frenk, J. Mittenthal, A.H.G. Rinnooy Kan,Single-machine scheduling subject to stochastic breakdown, Naval Res. Logist., 37, 661–677, 1990.
K.R. Baker and G.D. Scudder,Sequencing with earliness and tardiness penalties: a review, Operations Research, 38, 22–36, 1990.
J. Mittenthal, M. Raghavachari,Stochastic single machine scheduling with quadratic earlytardy penalties, Operations Research, 41, 786–796, 1993.
A. Allahverdi and J. Mittenthal,Scheduling on M parallel machine subject to random breakdowns to minimize expected mean flow time, Naval Res. Logist., 41, 677–682, 1994.
A. Allahverdi, J. Mittenthal,Scheduling on a two-machine flowshop subject to random breakdowns with makespan objective function, European Journal of Operational Research, 81, 376–387, 1995.
X. Cai, F.S. Tu,Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties, Naval Research Logistic, 43, 1127–1146, 1996.
X. Zhuo, X. Cai,General stochastic single-machine scheduling with regular cost function, Math. Comput., 26, 3, 95–108, 1997.
X. Cai and S. Zhou,Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs, Operations Research, 47, 3, 422–437, 1999.
X. Cai, X. Sun and S. Zhou,Stochastic scheduling with preemptive-repeat machine breakdowns to minimize the expected weighted flow time, Probability in the Engineering and informational sciences, 17, 467–485, 2003.
X. Cai, X. Sun and S. Zhou,Stochastic scheduling subject to machine breakdowns: The preemptive-repeat model with discounted reward and other criteria, Naval Res. Logist., 51, 800–817, 2004.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is supported by the National Natural Science Foundation of P.R. China(10471096).
Rights and permissions
About this article
Cite this article
Tang, H., Zhao, C. Stochastic single machine scheduling subject to machines breakdowns with quadratic early-tardy penalties for the preemptive-repeat model. J. Appl. Math. Comput. 25, 183–199 (2007). https://doi.org/10.1007/BF02832346
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02832346