Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/9760
Title: Machine scheduling with DeJong's learning effect
Authors: Ji, M
Yao, D
Yang, Q
Cheng, TCE 
Keywords: DeJong's learning effect
FPTAS
Makespan
Total completion time
Issue Date: 2015
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2015, v. 80, no. 1, p. 195-200 How to cite?
Journal: Computers and industrial engineering 
Abstract: We consider a relatively new learning model in scheduling based on DeJong's learning effect. Compared with the classical learning model for scheduling, this model is more general and realistic. The objectives are to minimize makespan and total completion time. For the single-machine case, we show that both of the objectives are polynomially solvable. For the parallel-machine case, we show that minimizing total completion time is still polynomially solvable, while minimizing makespan is NP-hard, for which we provide a fully polynomial-time approximation scheme (FPTAS).
URI: http://hdl.handle.net/10397/9760
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2014.12.009
Appears in Collections:Journal/Magazine Article

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 Oct 22, 2018

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
0
Citations as of Oct 13, 2018

Page view(s)

80
Last Week
0
Last month
Citations as of Oct 22, 2018

Google ScholarTM

Check

Altmetric


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