Single-machine scheduling with a nonlinear deterioration function

Authors:
Peng-Jen Lai;Wen-Chiung Lee
Affiliations:
Department of Mathematics, National Kaohsiung Normal University, Kaohsiung, Taiwan;Department of Statistics, Feng Chia University, Taichung, Taiwan
Venue:
Information Processing Letters
Year:
2010

Citing 12
Cited 3

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor

Operations Research
Scheduling linear deteriorating jobs with an availability constraint on a single machine

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

Information Processing Letters
Single-machine group scheduling problems with deterioration consideration

Computers and Operations Research
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint

Computers and Operations Research
Scheduling deteriorating jobs on a single machine with release times

Computers and Industrial Engineering
A two-machine flowshop makespan scheduling problem with deteriorating jobs

Computers and Industrial Engineering
Some scheduling problems with deteriorating jobs and learning effects

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

Information Processing Letters
Time-Dependent Scheduling

Time-Dependent Scheduling
A deteriorating jobs problem with quadratic function of job lateness

Computers and Industrial Engineering

The solution algorithms for the multiprocessor scheduling with workspan criterion

Expert Systems with Applications: An International Journal
Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration

Journal of Combinatorial Optimization
Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models

Computers and Operations Research

Quantified Score

Hi-index	0.89

Visualization

Abstract

In deteriorating job scheduling problems, most of the researchers assume that the actual job processing time is a function of its starting time. In this paper, we propose a new deterioration model in which the actual job processing time is a general function of the normal processing time of jobs already processed and its scheduled position at the same time. We show that some single-machine scheduling problems remain polynomially solvable.