| 一类加工时间依赖资源的单机排序问题 |
| |
| 引用本文： | 谢谢,赵传立,唐立新. 一类加工时间依赖资源的单机排序问题[J]. 数学的实践与认识, 2008, 38(16) |
| |
| 作者姓名： | 谢谢 赵传立 唐立新 |
| |
| 作者单位： | 1. 东北大学信息学院物流优化与控制研究所,辽宁,沈阳,110004
2. 沈阳师范大学数学与系统科学学院,辽宁,沈阳,110034 |
| |
| 基金项目： | 国家自然科学基金，国家高技术研究发展计划(863计划)，国家自然科学基金 |
| |
| 摘 要： | 讨论了一类有准备时间且任务的加工时间依赖资源的单机排序问题.目标函数为最大完工时间与分配给各任务资源消耗量的加权线性组合.给出了问题的若干相关性质.在此基础上,对于任务之间无优先约束和有任意优先约束的情况.分别给出了最优排列算法和最优资源分配方法.并用数值例子作了说明.
|
| 关 键 词： | 准备时间 算法 资源分配 最优排序 |
Single Machine Scheduling Problems with Resource Dependent Processing Times |
| |
| XIE Xie,ZHAO Chuan-li,TANG Li-xin. Single Machine Scheduling Problems with Resource Dependent Processing Times[J]. Mathematics in Practice and Theory, 2008, 38(16) |
| |
| Authors: | XIE Xie ZHAO Chuan-li TANG Li-xin |
| |
| Abstract: | We consider a single machine scheduling problem with ready time and task processing times given as linear functions dependent on some continuously divisible resources.The objective is to find optimal sequence of the tasks and allocation of limited resources,which minimize the sum of weighted makespan and the resource consumption.Based on some properties of the problem,for both no precedent constraints problem and precedent constrains problem we present polynomial algorithms respectively.We also give an example to illustrate them. |
| |
| Keywords: | Ready time algorithm resource allocation optimal sequence |
| 本文献已被 万方数据 等数据库收录！ |
