Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/647
Title: Customer order scheduling to minimize total weighted completion time
Authors: Wang, G
Cheng, TCE 
Keywords: 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 How to cite?
Journal: Omega 
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.
URI: http://hdl.handle.net/10397/647
ISSN: 0305-0483
DOI: 10.1016/j.omega.2005.09.007
Rights: Omega © 2005 Published by Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
A023r-3.pdfPre-published version144.28 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

14
Last Week
0
Last month
1
Citations as of May 1, 2016

WEB OF SCIENCETM
Citations

10
Last Week
0
Last month
0
Citations as of Apr 30, 2016

Page view(s)

297
Last Week
0
Last month
Checked on May 1, 2016

Download(s)

791
Checked on May 1, 2016

Google ScholarTM

Check

Altmetric



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