Please use this identifier to cite or link to this item:
Title: Production scheduling with supply and delivery considerations to minimize the makespan
Authors: Wang, Xiuli
Cheng, T. C. Edwin
Subjects: Scheduling
Supply and delivery
Performance bounds
Issue Date: May-2009
Publisher: Elsevier
Source: European journal of operational research, May 2009, v. 194, no. 3, p. 743-752.
Abstract: In this paper we study a scheduling model that simultaneously considers production scheduling, material supply, and product delivery. One vehicle with limited loading capacity transports unprocessed jobs from the supplier's warehouse to the factory in a fixed travelling time. Another capacitated vehicle travels between the factory and the customer to deliver finished jobs to the customer. The objective is to minimize the arrival time of the last delivered job to the customer. We show that the problem is NP-hard in the strong sense, and propose an O(n) time heuristic with a tight performance bound of 2. We identify some polynomially solvable cases of the problem, and develop heuristics with better performance bounds for some special cases of the problem. Computational results show that all the heuristics are effective in producing optimal or near-optimal solutions quickly.
Rights: European Journal of Operational Research © 2008 Elsevier B.V. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.ejor.2007.12.033
ISSN: 0377-2217
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
Production scheduling with supply and delivery considerations-Final.pdfPre-published version292.69 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.