Stochastic single machine scheduling with an exponentially distributed due date

Authors:
Chunfu Jia
Affiliations:
Department of Computer and System Sciences, Nankai University, Tianjin 300071, China
Venue:
Operations Research Letters
Year:
2001

Citing 5
Cited 2

Sequencing with earliness and tardiness penalties: a review

Operations Research
Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

Operations Research
Earliness-tardiness scheduling problems: II. Derivation of completion times about a restrictive common due date

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

Operations Research
Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs

Operations Research

Stochastic Scheduling With Asymmetric Earliness And Tardiness Penalties Under Random Machine Breakdowns

Probability in the Engineering and Informational Sciences
Scheduling preempt-repeat version jobs on a machine subject to stochastic breakdowns to minimize quadratic earliness-tardiness penalties (I)

CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider a single machine scheduling problem with random processing times to minimize the expected total weighted deviations of completion times from a random common due date. The processing times and the due date are exponentially distributed. The optimal schedules are shown to be @L-shaped, i.e., the sequence of w"i@l"i(=w"i/E(p"i),p"i is the processing time of job i) (i=1,2,...,n) has a single local maximum, where w"i and @l"i denote the weight and the processing time rate of job i, respectively. Moreover, the case where the machine is subject to stochastic breakdowns is also discussed.