一类最优交货期决策的模型

A Generalized Model of Optimal Due Date Determination

关键词:  总延误平方和  交货期  排序

Key words:  total squared value of lateness  due date  sequencing

摘要:

考虑几个独立工件在一台机器上加工,每个工件J_i交货期设置为d_i=r_i+kp_i^T,目标是确定最优乘子k^*及工件的最优排序s^*,使总的延误平方和最小.给出寻找最优乘子k^*及工件最优排序的方法.

Abstract:

This paper considers n independent jobs to be processed on a single machine,Each job is assigned a due date d₁=r₁+ kp₁^T(T ≥ 1). The objective is to determine the optimal multiple K^* and the optimal sequence s^* to minimize the total squared value of lateness. A procedure to find the optimal multiple k^* and the optimal sequence is presented.