Scheduling deteriorating jobs on a single processor

Sid Browne*, Uri Yechiali

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


N jobs are to be processed sequentially on a single machine. While waiting for processing, jobs deteriorate, causing the random processing requirement of each job to grow at a job-specific rate. Under such conditions, the actual processing times of the jobs are no longer exchangeable random variables and the expected makespan is no longer invariant under any scheduling strategy that disallows idleness. In this paper, we analyze the effects of different deterioration schemes and derive optimal scheduling policies that minimize the expected makespan, and, for some models, policies that minimize the variance of the makespan. We also allow for random setup and detaching times. Applications to optimal inventory issuing policies are discussed and extensions are considered.

Original languageEnglish
Pages (from-to)495-498
Number of pages4
JournalOperations Research
Issue number3
StatePublished - 1990
Externally publishedYes


Dive into the research topics of 'Scheduling deteriorating jobs on a single processor'. Together they form a unique fingerprint.

Cite this