EXPECTED MAKESPAN MINIMIZATION ON IDENTICAL MACHINES IN TWO INTERCONNECTED QUEUES

EXPECTED MAKESPAN MINIMIZATION ON IDENTICAL MACHINES IN TWO INTERCONNECTED QUEUES

We study the scheduling of jobs in a system of two interconnected service stations, called Q1 and Q2, on m(m ≥ 2) identical machines available in parallel, so that every machine can process any jobs in Q1 or Q2. Preemption is allowed. Under certain conditions on the arrival, service, and interconnec...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Probability in the engineering and informational sciences 2001-10, Vol.15 (4), p.409-443
Hauptverfasser: Javidi, Tara, Song, Nah-Oak, Teneketzis, Demosthenis
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study the scheduling of jobs in a system of two interconnected service stations, called Q1 and Q2, on m(m ≥ 2) identical machines available in parallel, so that every machine can process any jobs in Q1 or Q2. Preemption is allowed. Under certain conditions on the arrival, service, and interconnection processes, we determine a scheduling policy that minimizes the expected makespan.
ISSN:0269-9648
1469-8951
DOI:10.1017/S026996480115401X