Please use this identifier to cite or link to this item:
Title: Performance bound analysis of a heuristic for the total weighted flowtime problem with fixed delivery dates
Authors: Wang, X
Cheng, TCE 
Keywords: LRF heuristic
Performance bounds
Issue Date: 2012
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2012, v. 62, no. 2, p. 451-456 How to cite?
Journal: Computers and industrial engineering 
Abstract: We consider single-machine scheduling with fixed delivery dates, which are given or determined before the jobs are processed. A job is delivered on the earliest fixed delivery date that is no earlier than its completion time. The flowtime of a job is defined as its delivery date. The objective is to minimize the total weighted flowtime of the jobs. The largest ratio first (LRF) rule is a heuristic that sequences jobs in nonincreasing order of w j/p j, where p j and w j are the processing time and weight of job J j, respectively. We investigate the performance bounds of the LRF heuristic under different scenarios of the problem. We conducted computational experiments to test the performance of the heuristic. The results show that the LRF heuristic is able to produce near-optimal and optimal solutions.
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2011.10.010
Appears in Collections:Journal/Magazine Article

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


Last Week
Last month
Citations as of Sep 9, 2017

Page view(s)

Last Week
Last month
Checked on Sep 17, 2017

Google ScholarTM



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