|
|||||
|
|
| 带重入的单台机排序问题 | |
| 引用本文： | Jing Caixia,井彩霞,钱省三,唐国春.带重入的单台机排序问题[J].运筹学学报,2008,12(2):84-87. |
| 作者姓名： | Jing Caixia 井彩霞 钱省三 唐国春 |
| 作者单位： | 1. College of Management, University of Shanghai for Science and Technology, Shanghai 200093, China 2. 上海理工大学管理学院,上海,200093 3. 上海第二工业大学经济管理学院,上海,201209 |
| 基金项目： | 国家自然科学基金 , 上海市重点学科建设项目 , The National Research Foundation for Program of Higher Education of China |
| 摘 要： | 本文考虑带重入的单台机排序问题,重入是指每个工件在机器上加工不止一次.通过把重入模型转化为带平行链约束的排序问题,我们成功地获得了单机重入问题的两个目标函数的多项式时间最优算法,一个是总带权完工时间∑ωjCj,另一个是最大费用函数hmax. |
| 关 键 词： | 运筹学 排序 多项式时间算法 转化 重入 总带权完工时间 最大费用 Operations research scheduling polynomial algorithm transformation re-entrant total weighted completion time maximum cost 重入 排序问题 Machine Scheduling maximum cost total weighted completion time optimal polynomial time algorithms objective functions problems transforming models subject parallel chain constraints the machine single machine scheduling |
Single Machine Scheduling with Re-entrance |
|
| Jing Caixia.Single Machine Scheduling with Re-entrance[J].OR Transactions,2008,12(2):84-87. | |
| Authors: | Jing Caixia |
| Abstract: | We consider single machine scheduling problems with re-entrance, in which every job visits the machine more than once. By transforming the re-entrant models into models subject to parallel chain precedence constraints, we successfully get the optimal polynomial time algorithms for two objective functions of the problem, one is the total weighted completion time ΣωjCj and the other is the maximum cost hmax. |
| Keywords: | Operations research scheduling polynomial algorithm transformation re-entrant total weighted completion time maximum cost |
| 本文献已被 维普 万方数据 等数据库收录！ | |