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

Authors:
Zhi-Long Chen
Affiliations:
Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJ 08544, USA
Venue:
Operations Research Letters
Year:
1995

Citing 1
Cited 9

Complexity of scheduling tasks with time-dependent execution times

Information Processing Letters

Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine

Computers and Operations Research
Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs

Computers and Operations Research
An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan

Information Processing Letters
A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration

Advances in Engineering Software
Parametric fault model for RTD based threshold logic gates

ICC'06 Proceedings of the 10th WSEAS international conference on Circuits
Some single-machine and flowshop scheduling problems with a non-linear deterioration function

Computers & Mathematics with Applications
Scheduling to minimize makespan with time-dependent processing times

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A tabu method for a two-agent single-machine scheduling with deterioration jobs

Computers and Operations Research
A single-machine scheduling with a truncated linear deterioration and ready times

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a single-processor scheduling model where the execution time of a task is a decreasing linear function of its starting time. The complexity of the problem of minimizing the number of late tasks remains unknown for a set of tasks with identical due dates. We present an O(n^2)-time dynamic programming algorithm for solving this problem.