By Topic

Deterministic timed event graphs for performance optimization of cyclic manufacturing processes

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

3 Author(s)
Di Febbraro, A. ; Dept. of Commun., Comput. & Syst. Sci., Genoa Univ., Italy ; Minciardi, R. ; Sacone, S.

A model of a cyclic manufacturing system representable as a deterministic timed event graph is considered in this paper. It is possible to apply analytical techniques for performance evaluation of such systems. On this basis, a two-level optimization problem is considered. The higher level refers to the maximization of the system productivity with respect to the assignment of operations to machines, the lot sizes, and the service sequences at the various machines, assuming that unlimited work-in-progress and buffers of finite dimension are available. The lower level deals with the minimization of an aggregate cost taking into account the work-in-progress and the buffer dimensions

Published in:

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