Scheduling deliveries under uncertainty
2009-06-25
Research Paper
This publication is part of collection
| Related Files |
|---|
View PDF Version
(ERS-2009-040-LIS.pdf, 0.6MB) |
Quite 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.
Keywords
Classifications using
Journal of Economic Literature (JEL) Classification System
- L23 : Organization of Production
- M : Business Administration and Business Economics; Marketing; Accounting
- R4 : Transportation Systems
- M11 : Production Management
Automatically Extracted Terms
- 0.00
- machine
- 0.000
- plan jobs
- problem
- reservation
- dataset
- method
- heuristic
- priority
- order
- moment
- number
- time window
- window
- scheduling
- 0.006
- planning
- minslack
- 0.005
