| 交货期固定的工件准时完工数——最大排序问题的多项式时间算法 |
| |
| 引用本文： | 张峰. 交货期固定的工件准时完工数——最大排序问题的多项式时间算法[J]. 系统管理学报, 2000, 9(3): 224-228 |
| |
| 作者姓名： | 张峰 |
| |
| 作者单位： | 上海第二工业大学应用管理系，上海 200040 |
| |
| 基金项目： | 国家自然科学基金项目(19771057) |
| |
| 摘 要： | 给出了求解交货期固定的工件准时完工数最大的排序问题的多项式时间算法。
|
| 关 键 词： | 排序 交货期窗口 Just-In-Time 多项式时间算法 |
| 文章编号： | 1005-2542(2000)03-224-05 |
| 修稿时间： | 2000-02-28 |
Job Completed Just-In-Time in Single Machine and Parajllel Machins Scheduling Problem |
| |
| Zhang Feng. Job Completed Just-In-Time in Single Machine and Parajllel Machins Scheduling Problem[J]. Systems Engineering Theory·Methodology·Applications, 2000, 9(3): 224-228 |
| |
| Authors: | Zhang Feng |
| |
| Abstract: | In this paper, we discuss the scheduling problem of maximal number of jobs which must be completed at its due date Just-In-Time. We research two cases, single machine and parallel machine. We give two polynomial time algorithm to solve these two cases respectively. |
| |
| Keywords: | Just-In-Time scheduling due date window Just-In-Time polynomial time algorithm |
| 本文献已被 万方数据 等数据库收录！ |
