A Group-Dependent Due Window Assignment Scheduling Problem with Controllable Learning Effect

Abstract

In this paper, we study a single machine scheduling problem with group-dependent due window assignment and further incorporate autonomous and induced learning effects. Here, autonomous learning refers to learning by doing, while induced learning denotes that proactive investments can promote the learning effect, i.e., the learning effect is controllable. The proactive spending could include any management efforts like professional training programs, among others. The objective is to find optimal strategies of due window assignments, sequence of groups and jobs, and level of induced learning that optimize the total cost comprising the due window-related penalty costs and the investment cost. We present a polynomial-time algorithm capable of solving this problem and an improved idea to further reduce the time complexity. In addition, a detailed numerical example is conducted. Our study shows that the learning effect can be tuned to fit the demand of the manufacturing system better and lead to a more flexible operating system.