Scheduling deliveries under uncertainty
AbstractQuite often transportation companies face two types of jobs, ones which they can plan themselves and ones which have to be done on call. In this paper we study the scheduling of these jobs, while we assume that job durations are known beforehand as well as windows in which the jobs need to be done. We develop several heuristics to solve the problem at hand. The most successful are based on defining an appropriate buffer. The methods are assessed in extensive experiments on two aspects, viz. efficiency, in the sense that they carry out many jobs and certainty, in the sense that they provide information beforehand about which jobs they will execute.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam. in its series Research Paper with number ERS-2009-040-LIS.
Date of creation: 25 Jun 2009
Date of revision:
Contact details of provider:
Web page: http://www.erim.eur.nl/
T57.79; distribution problems; stochastic scheduling;
Find related papers by JEL classification:
- T57 - - - - - -
This paper has been announced in the following NEP Reports:
- NEP-ALL-2009-07-28 (All new papers)
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (ERIM Series Handler at the ERIM Office).
If references are entirely missing, you can add them using this form.