Please use this identifier to cite or link to this item:
Title: A note on the time complexity of machine scheduling with DeJong's learning effect
Authors: Zhao, CL
Fang, J
Cheng, TCE 
Ji, M
Keywords: Scheduling
DeJong's learning effect
Time complexity
Issue Date: 2017
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2017, v. 112, p. 447-449 How to cite?
Journal: Computers and industrial engineering 
Abstract: In a recent paper (Ji et al., 2015), the authors provided a fully polynomial-time approximation scheme (FPTAS) for the considered NP-hard problem. Extending this research, the authors in another paper (Ji et al., 2016) gave an FPTAS for a related NP-hard problem. In this note we show that the time complexity of the two FPTASes can be improved.
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2017.08.010
Appears in Collections:Journal/Magazine Article

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

Page view(s)

Last Week
Last month
Citations as of Dec 16, 2018

Google ScholarTM



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