Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1847
Title: Viewpoint on “A note on unrelated parallel machine scheduling with time-dependent processing times”
Authors: Li, CL 
Keywords: Scheduling
Parallel machines
Computational complexity
Issue Date: Dec-2008
Publisher: Palgrave Macmillan
Source: Journal of the Operational Research Society, Dec. 2008, v. 59, no. 12, 1696-1697 How to cite?
Journal: Journal of the Operational Research Society 
Abstract: In a recent article, Kuo et al study an unrelated parallel machine scheduling problem in which the processing time of a job is a linear function of its start time and the objective is to minimize the sum of job completion times (Kuo et al, 2008). They show that the problem is polynomial-time solvable when the number of machines is fixed. However, the computational complexity of their solution method is high. We provide here a modified solution method with an improved running time complexity.
URI: http://hdl.handle.net/10397/1847
ISSN: 0160-5682
DOI: 10.1057/palgrave.jors.2602648
Rights: © 2008 Operational Research Society Ltd.
This is a post-peer-review, pre-copyedit version of an article published in Journal of the Operational Research Society. The definitive publisher-authenticated version C.-L. Li, Journal of the Operational Research Society, 59, 1696–1697 (2008) is available online at: http://www.palgrave-journals.com/jors/journal/v59/n12/full/2602648a.html.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
59 Final-Version.pdfPre-published version60.41 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

5
Last Week
0
Last month
0
Citations as of Jun 4, 2016

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Jul 24, 2016

Page view(s)

385
Last Week
0
Last month
Checked on Jul 24, 2016

Download(s)

167
Checked on Jul 24, 2016

Google ScholarTM

Check

Altmetric



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