Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/9188
Title: Scheduling to minimize makespan with time-dependent processing times
Authors: Kong, LY
Cheng, TCE 
Ng, CT 
Zhao, M
Keywords: Fully polynomial approximation scheme
Makespan
Parallel machines scheduling
Issue Date: 2005
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2005, v. 3827 LNCS, p. 925-933 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: In this paper we study the scheduling problem of minimizing makespan on identical parallel machines with time-dependent processing times. We first consider the problem with time-dependent processing times on two identical machines to minimize makespan, which is NP-hard. We give a fully polynomial-time approximation scheme for the problem. Furthermore, we generalize the result to the case with m machines.
Description: 16th International Symposium on Algorithms and Computation, ISAAC 2005, Hainan, 19-21 December 2005
URI: http://hdl.handle.net/10397/9188
ISBN: 3540309357
9783540309352
ISSN: 0302-9743
EISSN: 1611-3349
Appears in Collections:Conference Paper

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

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Apr 14, 2018

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Apr 23, 2018

Page view(s)

70
Last Week
0
Last month
Citations as of Apr 23, 2018

Google ScholarTM

Check


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