Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time

Ali Allahverdi and John Mittenthal

Naval Research Logistics (NRL), 1994, vol. 41, issue 5, 677-682

Abstract: The problem of scheduling n jobs on m parallel machines is considered when the machines are subject to random breakdowns and job processing times are random variables. An objective function of mean flow time is developed for a general parallel machine system, and an expression of its expected value is derived. The problem is transformed into a deterministic unrelated parallel machine scheduling model with modified processing times when the number of breakdowns is modeled as a generalized Poisson process. © 1994 John Wiley & Sons, Inc.

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

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199408)41:53.0.CO;2-7

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:41:y:1994:i:5:p:677-682

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 ().