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. © Springer-Verlag Berlin Heidelberg 2005.
Author supplied keywords
Cite
CITATION STYLE
Kong, L. Y., Cheng, T. C. E., Ng, C. T., & Zhao, M. (2005). Scheduling to minimize makespan with time-dependent processing times. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3827 LNCS, pp. 925–933). https://doi.org/10.1007/11602613_92
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
