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
Flowshop scheduling with dominant machines
Computers and Operations Research
Parallel machine scheduling with time dependent processing times
Discrete Applied Mathematics
Scheduling linearly deteriorating jobs on multiple machines
Computers and Industrial Engineering - Special issue: new advances in analysis of manufacturing systems
Three scheduling problems with deteriorating jobs to minimize the total completion time
Information Processing Letters
Scheduling jobs under decreasing linear deterioration
Information Processing Letters
Flow shop scheduling problems with decreasing linear deterioration under dominant machines
Computers and Operations Research
Flow shop scheduling to minimize makespan with decreasing time-dependent job processing times
Computers and Industrial Engineering
| Hi-index | 0.01 |
In this paper, we consider a two-machine flow shop scheduling problem with deteriorating jobs. By a deteriorating job, we mean that the processing time is a decreasing function of its execution start time. A proportional linear decreasing deterioration function is assumed. The objective is to find a sequence that minimizes total completion time. Optimal solutions are obtained for some special cases. For the general case, several dominance properties and some lower bounds are derived to speed up the elimination process of a branch-and-bound algorithm. A heuristic algorithm is also proposed to overcome the inefficiency of the branch-and-bound algorithm. Computational results for randomly generated problem instances are presented, which show that the heuristic algorithm effectively and efficiently in obtaining near-optimal solutions.