FIRST COME, FIRST SERVED CAN BE UNSTABLE

被引：75

作者：

SEIDMAN, TI

机构：

[1] Department of Mathematics and Statistics, University of Maryland-Baltimore County, Baltimore, MD

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 1994年 / 39卷 / 10期

关键词：

D O I：

10.1109/9.328805

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We consider flexible manufacturing systems using the 'first come, first served' (FCFS or FIFO) scheduling policy at each machine. We describe and discuss in some detail simple deterministic examples which have adequate capacity but which, under FCFS, can exhibit instability; unboundedly growing WIP taking the form of a repealed pattern of behavior with the repetitions on an increasing scale.

引用

页码：2166 / 2171

页数：6

共 5 条

[1]

BRANSON M, 1994, ANN APPLIED PROB, P414

[2]

BRANSON M, IN PRESS ANN APPLIED

[3] DYNAMIC INSTABILITIES AND STABILIZATION METHODS IN DISTRIBUTED REAL-TIME SCHEDULING OF MANUFACTURING SYSTEMS [J].