| 链约束线性加工时间单机排序问题 |
| |
| 引用本文： | 赵传立,唐恒永.链约束线性加工时间单机排序问题[J].系统管理学报,2004,13(5):474-477. |
| |
| 作者姓名： | 赵传立 唐恒永 |
| |
| 作者单位： | 沈阳师范大学,数学与系统科学学院,沈阳,110034 |
| |
| 摘 要： | 讨论工件具有线性加工时间,工件间具有链约束的单机排序问题。目标函数为极小化加权完工时间和。在这类问题中,工件的加工时间是其开工时间的线性函数。对链不允许中断和链允许中断两种情况分别给出了最优算法。
|
| 关 键 词： | 排序 单机 链约束 线性加工时间 |
| 文章编号： | 1005-2542(2004)05-0474-04 |
| 修稿时间： | 2002年5月20日 |
Single Machine Scheduling Problem with Chain-Structured and Linear Processing Times |
| |
| ZHAO Chuan-li,TANG Heng-yong.Single Machine Scheduling Problem with Chain-Structured and Linear Processing Times[J].Systems Engineering Theory·Methodology·Applications,2004,13(5):474-477. |
| |
| Authors: | ZHAO Chuan-li TANG Heng-yong |
| |
| Abstract: | This paper considers the single machine scheduling problem with chain-structured and linear processing time. The objective is to minimize the weighted sum of completion time. For the two cases, the chains can be interrupted or can not, th eoptimal algorithms are presented respectively. |
| |
| Keywords: | scheduling single machine chain-structured linear processing time |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
