Skip to Main Content
Job deterioration and learning co-exist in many realistic scheduling situations. This paper introduces a general scheduling model that considers the effects of position-dependent learning and time-dependent deterioration simultaneously. In the proposed model, the actual processing time of a job depends not only on the total processing time of the jobs already processed but also on its scheduled position. This paper focuses on the single-machine scheduling problems with the objectives of minimizing the makespan, total completion time, total weighted completion time, discounted total weighted completion time, and maximum lateness based on the proposed model, respectively. It shows that they are polynomially solvable and optimal under certain conditions. Additionally, it presents some approximation algorithms based on the optimal schedules for the corresponding single-machine scheduling problems and analyzes their worst case error bound.