| Article ID | Journal | Published Year | Pages | File Type | 
|---|---|---|---|---|
| 10524222 | Operations Research Letters | 2005 | 10 Pages | 
Abstract
												The problem of assigning drivers to cover tasks with service time windows and uncertain task durations is formulated as a dynamic stochastic decision model. We develop an adaptive labeling solution procedure that can incorporate various practical constraints and work rules. Experiments are conducted to evaluate the procedure's performance and compare the stochastic and deterministic formulations.
											Keywords
												
											Related Topics
												
													Physical Sciences and Engineering
													Mathematics
													Discrete Mathematics and Combinatorics
												
											Authors
												Raymond K. Cheung, Darren D. Hang, Ning Shi, 
											