| 工件加工时间是开工时间线性函数的单机排序问题 |
| |
| 引用本文： | 高文军,王吉波,王晓远,殷娜,黄雪. 工件加工时间是开工时间线性函数的单机排序问题[J]. 数学的实践与认识, 2009, 39(3) |
| |
| 作者姓名： | 高文军 王吉波 王晓远 殷娜 黄雪 |
| |
| 作者单位： | 沈阳航空工业学院理学院,沈阳,110136 |
| |
| 基金项目： | 辽宁省教育厅科技研究项目 |
| |
| 摘 要： | 研究了具有线性恶化工件的单机排序问题,其中线性恶化工件指的是工件的加工时间是开工时间的线性增长函数.在一般情况下,对目标函数为极小化完工时间平方和与极小化总误工数问题分别给出了最优算法.此外,在分段情况下,对目标函数为极小化最大完工时间问题也给出了最优算法.
|
| 关 键 词： | 排序 单机 线性函数 完工时间平方和 总误工数 最大完工时间 |
Single Machine Scheduling Under job Processing time is a Linear Deterioration of its Start time |
| |
| GAO Wen-jun,WANG Ji-bo,WANG Xiao-yuan,YIN Na,HUANG Xue. Single Machine Scheduling Under job Processing time is a Linear Deterioration of its Start time[J]. Mathematics in Practice and Theory, 2009, 39(3) |
| |
| Authors: | GAO Wen-jun WANG Ji-bo WANG Xiao-yuan YIN Na HUANG Xue |
| |
| Abstract: | We consider the single machine scheduling with linearly deteriorating jobs,where linearly deteriorating jobs mean that the job processing time of a job is a linearly increasing function of its start time.For the general case,optimal algorithms are presented respectively for minimizing the sum of quadratic completion times and the number of tardy jobs.In addition,for the piecewise case,optimal algorithm is also presented for minimizing the maximal makespan. |
| |
| Keywords: | scheduling single machine linear function sum of quadratic completion times number of tardy jobs maximal makespan |
| 本文献已被 万方数据 等数据库收录！ |
|
