By Topic

Impact of finite buffers on the optimal scheduling of a single-machine two-part-type manufacturing system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

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)
Martinelli, F. ; Dipt. di Inf. e Sistemistica, Rome Univ., Italy ; Valigi, P.

We give a complete solution to a scheduling problem for a two-part-type, single-machine, flexible manufacturing system, with finite-capacity buffers. Backlogged and rejected requests incur a cost which must be minimized over an infinite time interval. If buffer capacities were infinite, the well-known cμ rule would have solved the problem. We find the optimal policy for the finite-capacity case and give a computation procedure and some illustrative examples.

Published in:

Automatic Control, IEEE Transactions on  (Volume:47 ,  Issue: 10 )