EconPapers    
Economics at your fingertips  
 

Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs

I. Adiri, E. Frostig and A. H. G. Rinnooy Kan

Naval Research Logistics (NRL), 1991, vol. 38, issue 2, 261-271

Abstract: Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs.

Date: 1991
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199104)38:23.0.CO;2-I

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:wly:navres:v:38:y:1991:i:2:p:261-271

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().

 
Page updated 2025-03-20
Handle: RePEc:wly:navres:v:38:y:1991:i:2:p:261-271