By Topic

Optimized scheduling of complex resource allocation systems through approximate dynamic programming

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

1 Author(s)
Reveliotis, S. ; Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA

In spite of the tremendous progress that has been attained by the scientific community on the sequencing and scheduling problems that underlie the operation of many technological applications, there is a remaining gap between the analytical insights and results offered by the existing scheduling theory and the solutions to the scheduling problems that are typically adopted in the industrial practice. The work undertaken in this project seeks to bridge this gap by tapping upon recent developments in the Supervisory Control of Resource Allocation Systems and Approximate Dynamic Programming. When combined, these two areas provide high-fidelity representations of the underlying dynamics and effective tools for developing (near-)optimal scheduling policies while explicitly managing the complexity that underlies the development and implementation of these policies. This write-up outlines the basic framework that supports the proposed approach and reports upon the current progress of the work.

Published in:

Dependable Control of Discrete Systems (DCDS), 2011 3rd International Workshop on

Date of Conference:

15-17 June 2011