Single facility scheduling with nonlinear processing times
Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor
Operations Research
Scheduling jobs under simple linear deterioration
Computers and Operations Research
Parallel machine scheduling with time dependent processing times
Discrete Applied Mathematics
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs
Journal of Heuristics
Information Processing Letters
Scheduling linear deteriorating jobs with an availability constraint on a single machine
Theoretical Computer Science
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
Information Processing Letters
Heuristics for parallel machine scheduling with deterioration effect
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities
Computers and Operations Research
Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
Theoretical Computer Science
Unrelated parallel-machine scheduling problems with multiple rate-modifying activities
Information Sciences: an International Journal
Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects
Computers and Operations Research
Approximation algorithms for parallel machine scheduling with linear deterioration
Theoretical Computer Science
Journal of Combinatorial Optimization
Hi-index | 5.23 |
We consider parallel-machine scheduling problems in which the processing time of a job is a simple linear increasing function of its starting time. The objectives are to minimize the makespan, total machine load, and total completion time. We show that all the problems are strongly NP-hard with an arbitrary number of machines and NP-hard in the ordinary sense with a fixed number of machines. For the former two problems, we prove that there exists no polynomial time approximation algorithm with a constant worst-case bound when the number of machines is arbitrary unless P=NP. When the number of machines is fixed, we propose two similar fully polynomial-time approximation schemes for the former two problems.