Expected makespan minimization on identical machines in two interconnected queues

0.00 Avg rating—0 Votes

Article ID:	iaor20023230
Country:	United States
Volume:	15
Issue:	4
Start Page Number:	409
End Page Number:	443
Publication Date:	Jan 2001
Journal:	Probability in the Engineering and Informational Sciences
Authors:	Teneketzis D., Javidi T., Song N.O.
Keywords:	queues: theory

Abstract:

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.

Reviews

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