Advertisement
Published in:
2005 | OriginalPaper | Chapter
Scheduling to Minimize Makespan with Time-Dependent Processing Times
Authors : L. Y. Kang, T. C. E. Cheng, C. T. Ng, M. Zhao
Published in: Algorithms and Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.