Please use this identifier to cite or link to this item:
Title: Customer order scheduling to minimize total weighted completion time
Authors: Wang, Guoqing
Cheng, T. C. Edwin
Subjects: Customer order scheduling
Linear programming relaxation
Approximation algorithm
Issue Date: Oct-2007
Publisher: Elsevier Ltd.
Source: Omega, Oct. 2007, v. 35, no. 5, p. 623-626.
Abstract: In this paper we study the scheduling problem in which each customer order consists of several jobs of different types, which are to be processed on m facilities. Each facility is dedicated to the processing of only one type of jobs. All jobs of an order have to be delivered to the customer at the same time. The objective is to schedule all the orders to minimize the total weighted order completion time. While the problem has been shown to be unary NP-hard, we develop a heuristics to tackle the problem and analyze its worst-case performance.
Rights: Omega © 2005 Published by Elsevier Ltd. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/
ISSN: 0305-0483
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
A023r-3.pdfPre-published version144.28 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.