-
摘要: 讨论一类线性加工时间单机调度问题.在这类问题中,工件具有相同的基本加工时间, 但每个工件的实际加工时间以其开工时间线性增长.对满足无延迟工件条件下极小化提前惩罚 和问题,满足最大完工时间限制条件下极小化资源消耗总量的问题和满足资源消耗总量限制条 件下极小化最大完工时间的问题,分别给出了最优算法.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 re source consumption constraints.
-
Key words:
- Scheduling /
- single machine /
- earliness penalties /
- resource constrained /
- optimal algorithm
-
计量
- 文章访问数: 2714
- HTML全文浏览量: 166
- PDF下载量: 893
- 被引次数: 0
下载:
