Online scheduling: generalized pinwheel problem

Author

Feinberg, Eugene A. ; Curry, Michael T.

Author_Institution

Dept. of Appl. Math. & Stat., State Univ. of New York, Stony Brook, NY, USA

Volume

4

fYear

2003

fDate

9-12 Dec. 2003

Firstpage

4333

Abstract

Consider a non-preemptive infinite horizon service system with a single server characterized by a service time and a maximum allowable time between consecutive services. A rigorous Markov Decision Process formulation is provided in order to develop a dynamic programming algorithm for determining a feasible schedule. The constraints are then relaxed in order to invoke a semi-MDP. This semi-MDP is used to generate a non-randomized policy which generates a schedule of jobs. An algorithm that searches this schedule for a subsequence which is feasible and can be implemented periodically is presented.

Keywords

Markov processes; decision theory; dynamic programming; infinite horizon; scheduling; Markov Decision Process formulation; dynamic programming algorithm; generalized pinwheel problem; nonpreemptive infinite horizon service system; nonrandomized policy; online scheduling; semiMDP; Dynamic programming; Dynamic scheduling; Heuristic algorithms; Infinite horizon; Mathematics; Processor scheduling; Scheduling algorithm; Signal processing; Statistics; Transmitters;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 2003. Proceedings. 42nd IEEE Conference on

ISSN

0191-2216

Print_ISBN

0-7803-7924-1

Type

conf

DOI

10.1109/CDC.2003.1271832

Filename

1271832