An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan

Authors:
Min Ji;T. C. E. Cheng
Affiliations:
College of Computer Science and Information Engineering, Zhejiang Gongshang University, Hangzhou 310035, P.R. China;Department of Logistics, The Hong Kong Polytechnic University, Kowloon, Hong Kong
Venue:
Information Processing Letters
Year:
2007

Citing 11
Cited 3

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor

Operations Research
V-shaped policies for scheduling deteriorating jobs

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

Information Processing Letters
Scheduling with time-dependent execution times

Information Processing Letters
Three scheduling problems with deteriorating jobs to minimize the total completion time

Information Processing Letters
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 Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem

Operations Research
A simple linear time algorithm for scheduling with step-improving processing times

Computers and Operations Research
A note on single-processor scheduling with time-dependent execution times

Operations Research Letters

An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan

Information Processing Letters
Single-machine scheduling with a nonlinear deterioration function

Information Processing Letters
Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.89

Visualization

Abstract

We study the problems of scheduling a set of nonpreemptive jobs on a single machine and identical parallel machines, where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objective is to minimize makespan. We first give a fully polynomial-time approximation scheme (FPTAS) for the case with a single machine. We then generalize the result to the case with m identical machines.