SINGLE MACHINE SCHEDULING WITH A LEARNING EFFECT AND A RATE-MODIFYING ACTIVITY
Chuanli Zhao () and
Hengyong Tang Additional contact information Chuanli Zhao: School of Mathematics and Systems Science, Shenyang Normal University, Shenyang, Liaoning, 110034, People's Republic of China
Hengyong Tang: School of Mathematics and Systems Science, Shenyang Normal University, Shenyang, Liaoning, 110034, People's Republic of China
In the paper, single machine scheduling problems with a learning effect and a rate-modifying activity are considered. Under the learning effect, the processing time of a job is a decreasing function of its position in the sequence. The rate-modifying activity is an event that can change the speed of the machine, and hence the processing time of jobs after the activity. The following objective functions are considered: the makespan, the total earliness, tardiness and completion time penalty, and the total earliness, tardiness, due-window starting time and due-window size penalty. Polynomial time algorithms are proposed to optimally solve the problems.