By Topic

Stable scheduling policies for flexible manufacturing systems

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Burgess, K. ; Dept. of Electr. Eng., Ohio State Univ., Columbus, OH, USA ; Passino, K.M.

In this brief note we provide a new analysis of the transient behavior of the clear-a-fraction policy of Perkins and Kumar (1989). In addition, we show that a new “clear-average-oldest-buffer” policy and a “random part selection” policy (of which “first-come-first-served” is a special case) are stable. Finally, we introduce a stable and efficient “stream modifier” that can be used to obtain network level stability results

Published in:

Automatic Control, IEEE Transactions on  (Volume:42 ,  Issue: 3 )