Title	Size-based Scheduling with Estimation Errors
Creator	Down, Douglas
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2020-08-21T15:02
Description	When job sizes are known, Shortest Remaining Processing Time (SRPT) is known to be an optimal (in a very strong sense) scheduling policy for a single server queue under general assumptions on underlying random variables. However, the performance of SRPT is known not to be robust to errors in processing time estimates. For a popular error model, we characterize the optimal policy using a Gittins Index approach and discuss its properties. The implementability of the policy is studied, with the structure of the optimal policy guiding heuristic policies that appear to perform well. Time permitting, issues for multiple server queues will be highlighted.
Extent	30.0 minutes
Subject	Mathematics; Mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: McMaster University
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2021-02-18
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0395904
URI	http://hdl.handle.net/2429/77328
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos