Please use this identifier to cite or link to this item:
Title: Machine scheduling with deliveries to multiple customer locations
Authors: Li, Chung-Lun
Vairaktarakis, George
Lee, Chung-Yee
Subjects: 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.
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.
Rights: European Journal of Operational Research © 2004 Elsevier B.V. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.ejor.2003.11.022
ISSN: 0377-2217
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
44 Final-Version.pdfPre-published version241.9 kBAdobe PDFView/Open

All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.