Publication:
SCHEDULING ON M PARALLEL MACHINES SUBJECT TO RANDOM BREAKDOWNS TO MINIMIZE EXPECTED MEAN FLOW TIME

Simple item page
dc.contributor.authorsALLAHVERDI, A; MITTENTHAL, J
dc.date.accessioned2022-03-12T16:56:51Z
dc.date.accessioned2026-01-11T19:29:45Z
dc.date.available2022-03-12T16:56:51Z
dc.date.issued1994
dc.description.abstractThe 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. (C) 1994 John Wiley & Sons, Inc.
dc.identifier.doi10.1002/1520-6750(199408)41:5<677
dc.identifier.issn0894-069X
dc.identifier.urihttps://hdl.handle.net/11424/226847
dc.identifier.wosWOS:A1994NY43900008
dc.language.isoeng
dc.publisherJOHN WILEY & SONS INC
dc.relation.ispartofNAVAL RESEARCH LOGISTICS
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectEXPONENTIAL SERVICE TIMES
dc.subjectPROCESSORS
dc.subjectTASKS
dc.subjectJOBS
dc.titleSCHEDULING ON M PARALLEL MACHINES SUBJECT TO RANDOM BREAKDOWNS TO MINIMIZE EXPECTED MEAN FLOW TIME
dc.typearticle
dspace.entity.typePublication
oaire.citation.endPage682
oaire.citation.issue5
oaire.citation.startPage677
oaire.citation.titleNAVAL RESEARCH LOGISTICS
oaire.citation.volume41

Files

Collections

Araştırma Çıktıları