Single-Machine Scheduling with Learning Effects and Maintenance: A Methodological Note on Some Polynomial-Time Solvable Cases

الملخص EN

This work addresses four single-machine scheduling problems (SMSPs) with learning effects and variable maintenance activity.

The processing times of the jobs are simultaneously determined by a decreasing function of their corresponding scheduled positions and the sum of the processing times of the already processed jobs.

Maintenance activity must start before a deadline and its duration increases with the starting time of the maintenance activity.

This work proposes a polynomial-time algorithm for optimally solving two SMSPs to minimize the total completion time and the total tardiness with a common due date.