By Topic

Scalable optimization algorithms for discrete event systems with real-time constraints: An overview of recent developments

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)
Jianfeng Mao ; Dept. of Manufacturing Engineering, Boston University, Brookline, MA 02446, USA ; Christos G. Cassandras

Discrete event systems with real-time constraints involve tasks that must be completed within specified hard deadlines. Guaranteeing such constraints requires a control effort measured through a cost function, giving rise to a class of nonlinear optimization problems. We overview recent developments aimed at solving such problems in an efficient scalable fashion suitable for on-line applications with limited computational resources. We describe how structural properties of the optimal state trajectory in such problems can be exploited and present a critical task decomposition algorithm (CTDA) when tasks are processed by a single-stage system. When tasks are processed over multiple stages and are subject to end-to-end real-time constraints, a different set of structural properties is exploited leading to a virtual deadline algorithm (VDA).

Published in:

Discrete Event Systems, 2008. WODES 2008. 9th International Workshop on

Date of Conference:

28-30 May 2008