We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
Optimized opportunistic multicast scheduling (OMS) has been studied previously by the authors for homogeneous cellular networks, where the problem of efficiently transmitting a co...
Tze-Ping Low, Man-On Pun, Yao-Win Peter Hong, C.-C...
Managing an industrial production facility requires carefully allocating limited resources, and gives rise to large, potentially complicated scheduling problems. In this paper we c...
Eyjolfur Asgeirsson, Jonathan W. Berry, Cynthia A....
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...