By Topic

Optimal scheduling control of a flexible machine

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
$33 $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)
D. D. Yao ; Dept. of Ind. Eng. & Oper. Res., Columbia Univ., New York, NY, USA ; J. G. Shanthikumar

A flexible machine that processes a set of different part types is considered. Each part type has its own Poisson arrival process, general processing requirement, and a given delay (flow time) constraint. The problem is to find an optimal control that schedules the machine among the part types on a real-time basis in order to minimize a cost function of the flow times and meet all the constraints. The cost function is quite general, and it requires only that the marginal costs can be ordered among the part types. Based on polymatroid theory, an optimal control is identified that partitions the part types into several groups and applies a priority rule among the groups. Within each group, the optimal control is an appropriate randomization among priority rules. An efficient algorithm is developed to characterize the optimal control completely

Published in:

IEEE Transactions on Robotics and Automation  (Volume:6 ,  Issue: 6 )