Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1836
Title: Machine scheduling with deliveries to multiple customer locations
Authors: Li, CL 
Vairaktarakis, G
Lee, CY
Keywords: Scheduling
Dynamic programming
Computational complexity
Issue Date: 1-Jul-2005
Publisher: Elsevier
Source: European journal of operational research, 1 July 2005, v. 164, no. 1, p. 39-51 How to cite?
Journal: European Journal of Operational Research 
Abstract: One important issue in production and logistics management is the coordination of activities between production and delivery. In this paper, we develop a single-machine scheduling model that incorporates routing decisions of a delivery vehicle which serves customers at different locations. The objective is to minimize the sum of job arrival times. The problem is NP-hard in the strong sense in general. We develop a polynomial time algorithm for the case when the number of customers is fixed. More efficient algorithms are developed for several special cases of the problem. In particular, an algorithm is developed for the single-customer case with a complexity lower than the existing ones.
URI: http://hdl.handle.net/10397/1836
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2003.11.022
Rights: European Journal of Operational Research © 2004 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
44 Final-Version.pdfPre-published version241.9 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

85
Last Week
3
Last month
1
Citations as of May 22, 2016

WEB OF SCIENCETM
Citations

68
Last Week
0
Last month
1
Citations as of May 26, 2016

Page view(s)

290
Last Week
4
Last month
Checked on May 29, 2016

Download(s)

574
Checked on May 29, 2016

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.