| 一类线性加工时间单机调度问题 |
| |
| 引用本文： | 赵传立, 张庆灵, 唐恒永. 一类线性加工时间单机调度问题. 自动化学报, 2003, 29(5): 703-708. |
| |
| 作者姓名： | 赵传立 张庆灵 唐恒永 |
| |
| 作者单位： | 1.东北大学理学院,沈阳;;;2.沈阳师范大学数学系,沈阳 |
| |
| 基金项目： | SupportedbyDoctorThesisFoundationofNortheasternUniversity(2 0 0 2 0 8) |
| |
| 摘 要： | 讨论一类线性加工时间单机调度问题.在这类问题中,工件具有相同的基本加工时间,但每个工件的实际加工时间以其开工时间线性增长.对满足无延迟工件条件下极小化提前惩罚和问题,满足最大完工时间限制条件下极小化资源消耗总量的问题和满足资源消耗总量限制条件下极小化最大完工时间的问题,分别给出了最优算法.
|
| 关 键 词： | 调度 单机 提前惩罚 资源约束 最优算法 |
| 收稿时间： | 2002-04-23 |
Single Machine Scheduling with Linear Processing Times |
| |
| ZHAO Chuan-Li, ZHANG Qing-Ling, TANG Heng-Yong. Single Machine Scheduling with Linear Processing Times. ACTA AUTOMATICA SINICA, 2003, 29(5): 703-708. |
| |
| Authors: | ZHAO Chuan-Li ZHANG Qing-Ling TANG Heng-Yong |
| |
| Affiliation: | 1. College of Science,Northeastern University,Shenyang;Department of Mathematics,Shenyang Normal University,Shenyang |
| |
| Abstract: | This paper considers the single machine scheduling problem. It is assumed that jobs have the same basic processing time, but the actual processing time of each job grows linearly with its starting time. Based on the analysis of the problem, optimal algorithms are presented for the problems to minimize the sum of earliness penalties subject to no tardy jobs, to minimize the total resource consumption with makespan constraints, and to minimize makespan with the total resource consumption constraints. |
| |
| Keywords: | Scheduling single machine earliness penalties resource constrained optimal algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《自动化学报》浏览原始摘要信息 |
|
点击此处可从《自动化学报》下载全文 |
