Please use this identifier to cite or link to this item:
Title: Automaton-based timed supervisory control for operational planning and scheduling under multiple job deadlines
Authors: Lin, Liyong
Shehabinia, Ahmad Reza
Brandin, Bertil
Su, Rong.
Keywords: Time-weighted automaton
Timed supervisory control
Issue Date: 2014
Source: Lin, L., Shehabinia, A. R., Su, R., & Brandin, B. (2014). Automaton-based timed supervisory control for operational planning and scheduling under multiple job deadlines. 2014 IEEE 53rd Annual Conference on Decision and Control (CDC), 5943-5948.
Abstract: In this paper we model an operational planning and scheduling problem under multiple job deadlines in a timeweighted automaton framework. We first present a method to determine whether all given job specifications and deadlines can be met by computing a supremal controllable job satisfaction sublanguage. When this supremal sublanguage is not empty, we compute one of its controllable sublanguages that ensures the minimum total job earliness by adding proper delays. When this supremal sublangauge is empty, we will determine the minimal sets of job deadlines that need to be relaxed.
DOI: 10.1109/CDC.2014.7040319
Rights: © 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [].
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:EEE Conference Papers

Page view(s) 50

Updated on Apr 19, 2021

Download(s) 20

Updated on Apr 19, 2021

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.