EXPECTED MAKESPAN MINIMIZATION ON IDENTICAL MACHINES IN TWO INTERCONNECTED QUEUES

Authors:
Tara Javidi;Nah-Oak Song;Demosthenis Teneketzis
Affiliations:
EECS Department, The University of Michigan, Ann Arbor, MI 48109-2122 E-mail: taraj@eecs.umich.edu;Advanced Network Technologies Division, National Institute of Standards and Technology, Gaithersburg, MD 20899-8920 E-mail: nsong@antd.nist.gov;EECS Department, The University of Michigan Ann Arbor, MI 48109-2122 E-mail: teneketzis@eecs.umich.edu
Venue:
Probability in the Engineering and Informational Sciences
Year:
2001

Citing 4
Cited 5

Preemptive scheduling with variable profile, precedence constraints and due dates

Discrete Applied Mathematics
Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan

Journal of the ACM (JACM)
Optimization over Time

Optimization over Time
Scheduling of Random Task Graphs on Parallel Processors

MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems

OPTIMAL CONTROL OF A TWO-STAGE TANDEM QUEUING SYSTEM WITH FLEXIBLE SERVERS

Probability in the Engineering and Informational Sciences
On the Introduction of an Agile, Temporary Workforce into a Tandem Queueing System

Queueing Systems: Theory and Applications
Maximizing the utilization of operating rooms with stochastic times using simulation

Proceedings of the 40th Conference on Winter Simulation
Delay-optimal server allocation in multiqueue multiserver systems with time-varying connectivities

IEEE Transactions on Information Theory
Heuristics for the Maximization of Operating Rooms Utilization Using Simulation

Simulation

Quantified Score

Hi-index	0.06

Visualization

Abstract

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.