Hostname: page-component-7b9c58cd5d-sk4tg Total loading time: 0 Render date: 2025-03-15T12:08:25.233Z Has data issue: false hasContentIssue false
  • English
  • Français

EXPECTED MAKESPAN MINIMIZATION ON IDENTICAL MACHINES IN TWO INTERCONNECTED QUEUES

Published online by Cambridge University Press:  11 January 2002

Tara Javidi ,
Nah-Oak Song  and
Demosthenis Teneketzis
Tara Javidi
Affiliation:
EECS Department, The University of Michigan, Ann Arbor, MI 48109-2122 E-mail: taraj@eecs.umich.edu
Nah-Oak Song
Affiliation:
Advanced Network Technologies Division, National Institute of Standards and Technology, Gaithersburg, MD 20899-8920 E-mail: nsong@antd.nist.gov
Demosthenis Teneketzis
Affiliation:
EECS Department, The University of Michigan Ann Arbor, MI 48109-2122 E-mail: teneketzis@eecs.umich.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 15 , Issue 4 , October 2001 , pp. 409 - 443
Copyright
© 2001 Cambridge University Press