A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
EXPECTED MAKESPAN MINIMIZATION ON IDENTICAL MACHINES IN TWO INTERCONNECTED QUEUES
2001
Probability in the engineering and informational sciences (Print)
Preserved Fulltext
We study the scheduling of jobs in a system of two interconnected service stations, called Q 1 and Q 2 , on m~m Ն 2! identical machines available in parallel, so that every machine can process any jobs in Q 1 or Q 2 + Preemption is allowed+ Under certain conditions on the arrival, service, and interconnection processes, we determine a scheduling policy that minimizes the expected makespan+
doi:10.1017/s026996480115401x
fatcat:xgkozsmlszcinmeoigcdciphve