A note on the time complexity of machine scheduling with DeJong's learning effect

Chuanli Zhao; Ji Fang; Edwin Tai Chiu Cheng; Min Ji

doi:10.1016/j.cie.2017.08.010

A note on the time complexity of machine scheduling with DeJong's learning effect

Chuanli Zhao, Ji Fang, Edwin Tai Chiu Cheng, Min Ji

Research output: Journal article publication › Journal article › Academic research › peer-review

8 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	447-449
Number of pages	3
Journal	Computers and Industrial Engineering
Volume	112
DOIs	https://doi.org/10.1016/j.cie.2017.08.010
Publication status	Published - 1 Oct 2017

Keywords

DeJong's learning effect
FPTAS
Scheduling
Time complexity

ASJC Scopus subject areas

General Computer Science
General Engineering

More information

10.1016/j.cie.2017.08.010

Cite this

@article{61473f1a57d0476ca84fc1a3d72db99e,

title = "A note on the time complexity of machine scheduling with DeJong's learning effect",

abstract = "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.",

keywords = "DeJong's learning effect, FPTAS, Scheduling, Time complexity",

author = "Chuanli Zhao and Ji Fang and Cheng, {Edwin Tai Chiu} and Min Ji",

year = "2017",

month = oct,

day = "1",

doi = "10.1016/j.cie.2017.08.010",

language = "English",

volume = "112",

pages = "447--449",

journal = "Computers and Industrial Engineering",

issn = "0360-8352",

publisher = "Elsevier Ltd",

}

TY - JOUR

T1 - A note on the time complexity of machine scheduling with DeJong's learning effect

AU - Zhao, Chuanli

AU - Fang, Ji

AU - Cheng, Edwin Tai Chiu

AU - Ji, Min

PY - 2017/10/1

Y1 - 2017/10/1

N2 - 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.

AB - 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.

KW - DeJong's learning effect

KW - FPTAS

KW - Scheduling

KW - Time complexity

UR - http://www.scopus.com/inward/record.url?scp=85027720544&partnerID=8YFLogxK

U2 - 10.1016/j.cie.2017.08.010

DO - 10.1016/j.cie.2017.08.010

M3 - Journal article

SN - 0360-8352

VL - 112

SP - 447

EP - 449

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

ER -

A note on the time complexity of machine scheduling with DeJong's learning effect

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this