Flowshop scheduling with dominant machines
Computers and Operations Research
Flow shop scheduling problems with decreasing linear deterioration under dominant machines
Computers and Operations Research
A two-machine flowshop makespan scheduling problem with deteriorating jobs
Computers and Industrial Engineering
Computers and Operations Research
Time-Dependent Scheduling
Deteriorating job scheduling to minimize the number of late jobs with setup times
Computers and Industrial Engineering
Minimizing makespan in three-machine flow shops with deteriorating jobs
Computers and Operations Research
Hi-index | 0.00 |
In this paper we consider the general, no-wait and no-idle permutation flowshop scheduling problem with deteriorating jobs, i.e., jobs whose processing times are increasing functions of their starting times. We assume a linear deterioration function with identical increasing rates for all the jobs and there are some dominating relationships between the machines. We show that the problems to minimize the makespan and the total completion time remain polynomially solvable when deterioration is considered, although these problems are more complicated than their classical counterparts without deterioration.