By Topic

On the optimality of myopic production controls for single-server, continuous-flow manufacturing systems

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

3 Author(s)
F. Martinelli ; Dipartimento di Inf. e Sistemistica, Rome Univ., Italy ; Chang Shu ; J. R. Perkins

In this note, we consider a broad class of dynamic scheduling problems associated with a single-server, multiclass, continuous-flow manufacturing system. Using a general framework, we provide conditions under which the solution to these problems is the implementation of a class of production controls called myopic scheduling policies. The proof of optimality, which is intuitively appealing, applies to more general production models than existing proofs in the literature, which typically either use the maximum principle or solve the Hamilton-Jacobi-Bellman (HJB) equation. We also present several counter-examples that explicitly illustrate the potential limitations of myopic scheduling policies

Published in:

IEEE Transactions on Automatic Control  (Volume:46 ,  Issue: 8 )