Scheduling to minimize makespan with time-dependent processing times

Authors:
L. Y. Kang;T. C. E. Cheng;C. T. Ng;M. Zhao
Affiliations:
,Department of Mathematics, Shanghai University, Shanghai, China;Department of Logistics, The Hong Kong Polytechnic University;Department of Logistics, The Hong Kong Polytechnic University;Department of Mathematics, Shanghai University, Shanghai, China
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 8
Cited 0

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor

Operations Research
Complexity of scheduling tasks with time-dependent execution times

Information Processing Letters
Parallel machine scheduling with time dependent processing times

Discrete Applied Mathematics
Single machine scheduling with deadlines and increasing rates of processing times

Acta Informatica
Minimizing the total weighted completion time of deteriorating jobs

Information Processing Letters
A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs

Journal of Heuristics
A note on single-processor scheduling with time-dependent execution times

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.