Single Machine Scheduling Problem When the Machine Capacity Varies Stochastically

Tetsuji Hirayama and Masaaki Kijima
Additional contact information
Tetsuji Hirayama: The University of Tsukuba, Ibaraki, Japan
Masaaki Kijima: The University of Tsukuba, Tokyo, Japan

Operations Research, 1992, vol. 40, issue 2, 376-383

Abstract: We consider single machine scheduling problems when the machine capacity varies stochastically over time. Suppose that R ( t ) ≥ 0 processing requirements can be processed per unit of time at time t . First, we treat the general “machine capacity” R ( t ) and then consider the machine breakdown models where R ( t ) = 0 or 1. Jobs may arrive according to an arbitrary process. We show that simple priority rules are optimal under some assumptions. Specifically, the c μ rule minimizes the expected weighted total number of jobs if the processing requirements are exponentially distributed. The SEPT rule minimizes the expected total number of jobs if the processing requirements of jobs are stochastically ordered. The SERPT rule also minimizes it if the processing requirements form an ICR family.

Keywords: production/scheduling; sequencing; stochastic: capacity varying machine; queues; optimization: cμ rule (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.40.2.376 (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:40:y:1992:i:2:p:376-383

Access Statistics for this article

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