| 最优公共交货期决策与排序 |
| |
| 引用本文： | 兰继斌,陈荣秋.最优公共交货期决策与排序[J].广西大学学报(自然科学版),1996,21(4):356-359. |
| |
| 作者姓名： | 兰继斌 陈荣秋 |
| |
| 作者单位： | [1]广西大学数学与信息科学系 [2]华中理工大学 |
| |
| 摘 要： | 考虑ｎ个独立工件单机作业排序，每个工件设置ＣＯＮ交货期（ｃｏｎｓｔａｎｔｄｕｅ－ｄａｅ）目标是确定ＣＯＮ交货期的最优值和工件的最优排序，使工件的滞后总值最小。提出了这个问题的线性规则模型，然后利用线性规划对偶问题推导出ＣＯＮ交货期的最优值和最优排序。
|
| 关 键 词： | 排序 公共交货期 企业 生产管理 最优交货期 |
Optimal Constant Due-Date Assignment and Sequencing |
| |
| Lan Jibin,Tao Peihua,Chen Rongqiu.Optimal Constant Due-Date Assignment and Sequencing[J].Journal of Guangxi University(Natural Science Edition),1996,21(4):356-359. |
| |
| Authors: | Lan Jibin Tao Peihua Chen Rongqiu |
| |
| Abstract: | his paper considers the sequencing of n indpendent jobs in a single machine shop in which each job is assigned a constant due-date. The objective is to determent the optimal value of constant due-date and the optimal sequencing to minimize the total value of lateness.A linear programing (LP) formulation of the problem is propounded,the optimal value of constant due-date and optimal sequencing is derived via considering the LP dual problem. |
| |
| Keywords: | sequencing constant due-date total value of lateness |
| 本文献已被 CNKI 维普 等数据库收录！ |
