Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/24631
Title: Machine scheduling with pickup and delivery
Authors: Li, CL 
Ou, J
Keywords: Pickup and delivery
Scheduling
Worst-case analysis
Issue Date: 2005
Publisher: John Wiley & Sons
Source: Naval research logistics, 2005, v. 52, no. 7, p. 617-630 How to cite?
Journal: Naval research logistics 
Abstract: The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single-machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP-hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally.
URI: http://hdl.handle.net/10397/24631
ISSN: 0894-069X
EISSN: 1520-6750
DOI: 10.1002/nav.20101
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

36
Last Week
0
Last month
1
Citations as of Aug 21, 2017

WEB OF SCIENCETM
Citations

23
Last Week
0
Last month
0
Citations as of Aug 14, 2017

Page view(s)

54
Last Week
0
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



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