| 带有资源消耗的加权总完工时间单机排序问题 |
| |
| 引用本文： | 唐恒永,赵琨.带有资源消耗的加权总完工时间单机排序问题[J].系统工程与电子技术,2004,26(11):1601-1603. |
| |
| 作者姓名： | 唐恒永 赵琨 |
| |
| 作者单位： | 沈阳师范大学数学与系统科学学院,辽宁,沈阳,110034 |
| |
| 基金项目： | 辽宁省教委科研基金资助课题(20262250) |
| |
| 摘 要： | 讨论了带有资源消耗的加权总完工时间单机排序问题,其加工时间是资源量的线性函数,目标函数是完工时间和消耗资源量的加权总和。由于该问题是NP 难问题,所以给出了一个非常有效的局部搜索算法及其算法复杂性和一个算例。利用有关资源分配的性质分别对单位资源分配量的消耗相等、工件的权因子相等、工件的资源分配上限相等和单位资源分配量的消耗相等、工件的权因子相等、工件的正常加工时间相等两种特殊情况给出了最优算法。
|
| 关 键 词： | 运筹学 排序 算法 资源约束 加工时间 |
| 文章编号： | 1001-506X(2004)11-1601-03 |
| 修稿时间： | 2003年10月22 |
Single machine scheduling problem to minimize total compression with weighted flow cost |
| |
| TANG Heng-yong,ZHAO Kun.Single machine scheduling problem to minimize total compression with weighted flow cost[J].System Engineering and Electronics,2004,26(11):1601-1603. |
| |
| Authors: | TANG Heng-yong ZHAO Kun |
| |
| Abstract: | To study the single machine scheduling problem to minimize total compressing with weighted flow cost which is NP-hard, an efficient local search algorithm and its complexity are given. With the given properties, optimal algorithms for two special cases are given respectively, that is, the case which has equivalent expenditure of resources, equivalent weighted factor fo job and equivalent upper limit of resource, and the case which has equivalent expenditure of resources, equivalent weighted factor of job and equivalent normal processing time of job. |
| |
| Keywords: | operation research scheduling algorithm resource constraint processing time |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
