| 恶化率与工件无关的线性加工时间调度问题 |
| |
| 引用本文： | 赵传立,唐恒永.恶化率与工件无关的线性加工时间调度问题[J].数学的实践与认识,2005,35(3):20-27. |
| |
| 作者姓名： | 赵传立 唐恒永 |
| |
| 作者单位： | 沈阳师范大学数学与系统科学学院,辽宁,沈阳,110034 |
| |
| 摘 要： | 讨论恶化率与工件无关的线性加工时间调度问题 .对于工件间具有平行链约束 ,目标函数为极小化最大完工时间的单机问题 ,分别就链不允许中断和链允许中断两种情况给出了最优算法 .对于工件间没有优先约束 ,目标函数为极小化完工时间和的平行机问题 ,证明了工件按基本加工时间不减排列可以得到最优调度 .
|
| 关 键 词： | 调度 线性加工时间 单机 平行机 链约束 |
| 修稿时间： | 2002年12月3日 |
Scheduling Problem with Job-independent Deterioration Rates and Linear Processing Times |
| |
| ZHAO Chuan-li,TANG Heng-yong.Scheduling Problem with Job-independent Deterioration Rates and Linear Processing Times[J].Mathematics in Practice and Theory,2005,35(3):20-27. |
| |
| Authors: | ZHAO Chuan-li TANG Heng-yong |
| |
| Abstract: | This paper considers the scheduling problem with job-independent deterioration rates and linear processing times. We first consider the single machine problem with parallel chain-structured jobs, the objective is to minimize the makespan. For the two cases, the chains can be interrupted or not, the optimal algorithms are presented, respectively. Then for the parallel machine problem to minimize the sum of completion times, we show that an optimal schedule can be obtained by sequencing jobs in non-decreasing order of basic processing times. |
| |
| Keywords: | scheduling linear processing times single machine parallel machine chain-structured |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
