An efficient algorithm for scheduling problem with batching and common due window

作者：Zhao Hongluan^*; Li Guojun; Wang Jiqiang; Han Guoyong

来源：International Conference on Computational Intelligence and Security, 2007-12-15 to 2007-12-19.

• scheduling
• due window
• family
• early
• tardy

Jobs share a common due window and belong to distinct families with sequence-independent setup tasks on a single machine. The window location and size are decision variables with linear penalties. Our objective is to find a schedule minimizing the sum of the weighted number of early and tardy jobs, together with the determination cost of the due Following several properties of an optimal schedule, a polynomial algorithm is firstly proposed and range it to P-problem.

• 出版日期2007
• 单位山东建筑大学