Scheduling preempt-repeat version jobs on a machine subject to stochastic breakdowns to minimize quadratic earliness-tardiness penalties (I)

Authors:
Congdian Cheng
Affiliations:
College of Mathematics and Systems Science, Shenyang Normal University, Shenyang, China
Venue:
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 2
Year:
2010

Citing 5
Cited 0

Single machine flow-time scheduling with a single breakdown

Acta Informatica
Sequencing with earliness and tardiness penalties: a review

Operations Research
Stochastic single machine scheduling with quadratic early-tardy penalties

Operations Research
STOCHASTIC SCHEDULING WITH PREEMPTIVE-REPEAT MACHINE BREAKDOWNS TO MINIMIZE THE EXPECTED WEIGHTED FLOW TIME

Probability in the Engineering and Informational Sciences
Stochastic single machine scheduling with an exponentially distributed due date

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article addresses the problem of scheduling n preempt-repeat version jobs with a common due date on a machine subject to stochastic breakdowns to minimize quadratic earliness-tardiness penalties. I proceed to study under the condition of the uptimes following an exponential distribution and with the method of large analysis of random variables. My main contributions are as follows. (1) An analytic expression for the second moment ofthe completion time about a preempt-repeat version job processed on a machine subject to stochastic breakdowns is proposed. (2) The result that the optimal solutions are V-shaped is proposed and proven.