Scheduling problems with adjusted time

This paper considers further the scheduling problems with deterioration. In the corresponding scheduling problems, we enter an adjusted time sj for job j, j = 1,2,…,n. It is dependent on the unadjusted processing times of the jobs and is a function of a ‘wearing effect’ bj. We are asked to sequence the n jobs in such a way that objective functions based on the actual times of the schedule are minimized. For the following three objective functions: the makespan, the total completion time and JIT problem.