Sojourn times in G/M/1 fork-join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Naval research logistics 2008-08, Vol.55 (5), p.432-443
Hauptverfasser:	Ko, Sung-Seok, Serfozo, Richard F.
Format:	Artikel
Sprache:	eng
Schlagworte:	assembly network communications network fork-join network parallel processing queueing supply chains synchronization
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!