Author:
Javidi Tara,Song Nah-Oak,Teneketzis Demosthenis
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.
Publisher
Cambridge University Press (CUP)
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献