| 摘要: |
| 考虑几个独立工件在一台机器上加工,每个工件Ji交货期设置为di=ri+kpiT,目标是确定最优乘子k*及工件的最优排序s*,使总的延误平方和最小.给出寻找最优乘子k*及工件最优排序的方法. |
| 关键词: 总延误平方和 交货期 排序 |
| DOI： |
| 投稿时间：1998-03-26 |
| 基金项目: |
|
| A Generalized Model of Optimal Due Date Determination |
|
Lan Jibin
|
| (Dept. of Math. & Info. Sci., Guangxi Univ., 10 Xixiangtanglu, Nanning, Guangxi, 530004) |
| Abstract: |
| This paper considers n independent jobs to be processed on a single machine,Each job is assigned a due date d1=r1+ kp1T(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. |
| Key words: total squared value of lateness due date sequencing |
