DocumentCode :
2403747
Title :
Optimal stochastic scheduling of connected queues with switching costs
Author :
Van Oyen, Mark P. ; Teneketzis, Demosthenis
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
fYear :
1992
fDate :
1992
Firstpage :
3328
Abstract :
Structural properties of optimal policies for the problem of scheduling a single server in a forest network of N queues (without arrivals) subject to switching penalties are presented. In addition to linear holding costs, either lump sum switching costs or batch set-up delays that are incurred at each instant the server processes a job in a queue different than the previous one are composed. Reward rate notions are used to unearth conditions on the holding costs and service distributions for which an exhaustive policy is optimal. For the case of two nodes connected probabilistically in tandem, an optimal policy under similar conditions is explicitly defined
Keywords :
optimal control; queueing theory; trees (mathematics); batch set-up delays; connected queues; exhaustive policy; forest network; holding costs; linear holding costs; lump sum switching costs; optimal stochastic scheduling; reward rate notions; service distributions; switching penalties; Communication networks; Communication switching; Cost function; Delay; Delay effects; Job shop scheduling; Manufacturing; Network servers; Processor scheduling; Stochastic processes; Switches;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control, 1992., Proceedings of the 31st IEEE Conference on
Conference_Location :
Tucson, AZ
Print_ISBN :
0-7803-0872-7
Type :
conf
DOI :
10.1109/CDC.1992.371021
Filename :
371021
Link To Document :
بازگشت