Scheduling jobs under decreasing linear deterioration

Authors:
Ji-Bo Wang;Zun-Quan Xia
Affiliations:
Department of Science, Shenyang Institute of Aeronautical Engineering, Shenyang, People's Republic of China;Department of Applied Mathematics, Dalian University of Technology, Dalian, People's Republic of China
Venue:
Information Processing Letters
Year:
2005

Citing 6
Cited 8

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 jobs under simple linear deterioration

Computers and Operations Research
The complexity of scheduling starting time dependent tasks with release times

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

Information Processing Letters

Flow shop scheduling problems with decreasing linear deterioration under dominant machines

Computers and Operations Research
Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times

Computers and Operations Research
Single machine group scheduling under decreasing linear deterioration

Journal of Applied Mathematics and Computing
Single machine parallel-batch scheduling with deteriorating jobs

Theoretical Computer Science
Flowshop scheduling problems with transportation or deterioration between the batching and single machines

Computers and Industrial Engineering
Two-machine flow shop scheduling with linear decreasing job deterioration

Computers and Industrial Engineering
Single machine scheduling with decreasing linear deterioration under precedence constraints

Computers & Mathematics with Applications
Two-machine flow shop problem with effects of deterioration and learning

Computers and Industrial Engineering

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper considers the scheduling problems under decreasing linear deterioration. Deterioration of a job means that its processing time is a function of its execution start time. Optimal algorithms are presented respectively for single machine scheduling of minimizing the makespan, maximum lateness, maximum cost and number of late jobs. For two-machine flow shop scheduling problem to minimize the makespan, it is proved that the optimal schedule can be obtained by Johnson's rule. If the processing times of operations are equal for each job, flow shop scheduling problems can be transformed into single machine scheduling problems.