An approximate dynamic programming approach to the development of heuristics for the scheduling of impatient jobs in a clearing system

Li, D and Glazebrook, K D (2010) An approximate dynamic programming approach to the development of heuristics for the scheduling of impatient jobs in a clearing system. Naval Research Logistics, 57. pp. 225-236. ISSN 0894-069X

[img]
Preview
PDF (An approximate dynamic programming approach to the development of heuristics for the scheduling of impatient jobs in a clearing system)
10.pdf - Submitted Version

Download (311kB)

Abstract

A single server is faced with a collection of jobs of varying duration and urgency. Each job has a random lifetime during which it is available for nonpreemptive service. Should a job's lifetime expire before its service begins then it is lost from the system unserved. The goal is to schedule the jobs for service to maximize the expected number served to completion. Two heuristics have been proposed in the literature. One (labeled πS) operates a static priority among the job classes and works well in a “no premature job loss” limit, whereas the second (πM) is a myopic heuristic which works well when lifetimes are short. Both can exhibit poor performance for problems at some distance from the regimes for which they were designed. We develop a robustly good heuristic by an approximative approach to the application of a policy improvement step to the asymptotically optimal heuristic πS, in which we use a fluid model to obtain an approximation for the value function of πS. The performance of the proposed heuristic is investigated in an extensive numerical study.

Item Type:
Journal Article
Journal or Publication Title:
Naval Research Logistics
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2200/2212
Subjects:
ID Code:
45362
Deposited By:
Deposited On:
11 Jul 2011 18:30
Refereed?:
No
Published?:
Published
Last Modified:
12 Jul 2020 03:31