| 带不可用时间段和恶化加工时间的几个多项式可解问题 |
| |
| 引用本文： | 马英,左春荣. 带不可用时间段和恶化加工时间的几个多项式可解问题[J]. 合肥工业大学学报(自然科学版), 2009, 32(3) |
| |
| 作者姓名： | 马英 左春荣 |
| |
| 作者单位： | 合肥工业大学,管理学院,安徽,合肥,230009;合肥工业大学,管理学院,安徽,合肥,230009 |
| |
| 基金项目： | 国家自然科学基金，教育部高等学校博士学科点专项科研基金 |
| |
| 摘 要： | 文章研究了机器带有一个不可用时间段并且加工时间恶化的单机调度问题,考虑了2种不同加工时间函数下的2种目标函数;首先讨论了机器一直可用的情况,证明了2个带恶化加工时间的问题是多项式可解的,在此基础上对机器带一个不可用时间段时的情况进行了讨论,证明了这2种约束下的几个问题的多项式可解性.
|
| 关 键 词： | 单机调度 不可用时间段 恶化加工时间 多项式时间算法 |
Several polynomial solvable problems with deteriorating jobs and an availability constraint |
| |
| MA Ying,ZUO Chun-rong. Several polynomial solvable problems with deteriorating jobs and an availability constraint[J]. Journal of Hefei University of Technology(Natural Science), 2009, 32(3) |
| |
| Authors: | MA Ying ZUO Chun-rong |
| |
| Affiliation: | School of Management;Hefei University of Technology;Hefei 230009;China |
| |
| Abstract: | This paper studies several single machine's scheduling problems with deteriorating jobs and an availability constraint on the basis of two different criteria and two time-dependent functions.At first,the case without availability constraints is considered,and two problems with deteriorating jobs are shown to be polynomially solvable.Then the case with an availability constraint is investigated,and several problems with both deteriorating jobs and an availability constraint are proved to be polynomially solv... |
| |
| Keywords: | single machine scheduling availability constraint deteriorating job polynomial algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
