Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/12233
Title: Scheduling start time dependent jobs to minimize the total weighted completion time
Authors: Bachman, A
Cheng, TCE 
Janiak, A
Ng, CT 
Keywords: Computational analysis
Heuristics
Scheduling
Single machine
Start time dependent processing time
Issue Date: 2002
Publisher: Palgrave Macmillan
Source: Journal of the Operational Research Society, 2002, v. 53, no. 6, p. 688-693 How to cite?
Journal: Journal of the Operational Research Society 
Abstract: This paper deals with a single machine scheduling problem with start time dependent job processing times. The job processing times are characterized by decreasing linear functions dependent on their start times. The problem is to find a schedule for which the total weighted completion time is minimized. It is proved that the problem is NP-hard. Some properties of special cases of the general problem are also given. Based on these results, two heuristic algorithms are constructed and their performance is compared.
URI: http://hdl.handle.net/10397/12233
ISSN: 0160-5682
EISSN: 1476-9360
DOI: 10.1057/palgrave.jors.2601359
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

58
Last Week
0
Last month
0
Citations as of Sep 24, 2017

WEB OF SCIENCETM
Citations

57
Last Week
1
Last month
0
Citations as of Sep 22, 2017

Page view(s)

56
Last Week
0
Last month
Checked on Sep 25, 2017

Google ScholarTM

Check

Altmetric



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