Scheduling Deteriorating Jobs on a Single Processor

Sid Browne and Uri Yechiali
Additional contact information
Sid Browne: Columbia University, New York, New York
Uri Yechiali: Tel-Aviv University, Tel-Aviv, Israel

Operations Research, 1990, vol. 38, issue 3, 495-498

Abstract: 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.

Keywords: inventory/production; policies; maintenance/replacement: scheduling deteriorating jobs; probability; renewal processes; modeling probabilistic deterioration; production/scheduling: scheduling deteriorating jobs (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (82)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.3.495 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:38:y:1990:i:3:p:495-498

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().