Improving fleet utilization for carriers by interval scheduling
Carriers are under increasing pressure to offset rising fuel charges with cost cutting or revenue generating schemes. One opportunity for cost reduction lies in asset management. This paper presents resource allocation scheduling models that can be used to assign truck loads to delivery times and trucks when delivery times are flexible. The paper makes two main contributions. First, we formulate the problem as a multi-objective optimization model — minimizing the number of trucks needed as well as the costs associated with tardiness or earliness — and demonstrate how improvements in fleet usage translate into savings which carriers can use as incentives to promote flexible delivery times for customers. Second, we show that a two-phase model with a polynomial algorithm in the second phase is able to produce optimal schedules in a reasonable time.
If 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 218 (2012)
Issue (Month): 1 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/locate/eor|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Daniels, Richard L., 1990. "A multi-objective approach to resource allocation in single machine scheduling," European Journal of Operational Research, Elsevier, vol. 48(2), pages 226-241, September.
- Kovalyov, Mikhail Y. & Ng, C.T. & Cheng, T.C. Edwin, 2007. "Fixed interval scheduling: Models, applications, computational complexity and algorithms," European Journal of Operational Research, Elsevier, vol. 178(2), pages 331-342, April.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:218:y:2012:i:1:p:261-269. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.