Scheduling of m parallel machines subject to random breakdowns to minimize expected mean flow time

Scheduling of m parallel machines subject to random breakdowns to minimize expected mean flow time

0.00 Avg rating0 Votes
Article ID: iaor1995145
Country: United States
Volume: 41
Issue: 5
Start Page Number: 677
End Page Number: 682
Publication Date: Aug 1994
Journal: Naval Research Logistics
Authors: ,
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.

Reviews

Required fields are marked *. Your email address will not be published.