三个平行序链的顺序优化决策

中国管理科学 ›› 2006, Vol. ›› Issue (4): 69-74.

三个平行序链的顺序优化决策

李星梅^1,2, 乞建勋¹, 牛东晓¹

1. 华北电力大学工商管理学院, 北京, 102206;
2. 首都经济贸易大学统计系, 北京, 100070

收稿日期:2005-06-15 修回日期:2006-07-17 出版日期:2006-08-28 发布日期:2012-03-07
基金资助:
国家自然科学基金资助项目(80579101);教育部博士点基金资助项目(20050079008);华北电力大学重点预研项目资助.

The sequential optimal decision of three parallel procedure chains

LI Xing-mei^1,2, QI Jian-xun¹, NIU Dong-xiao¹

1. Institute of Business Management, North China Electric Power University, Beijing 102206, China;
2. Department of Statistics, Capital University of Economics and Business, Beijing 100070, China

Received:2005-06-15 Revised:2006-07-17 Online:2006-08-28 Published:2012-03-07

摘要/Abstract

摘要： 平行序链的顺序优化是目前网络计划优化理论中研究的焦点之一.本文在不允许有中断并考虑机动时间的假设条件下,对三个平行序链的顺序优化提出了一种新的算法.算例表明,该算法简单易行,便于应用.

关键词: 平行序链, 中断, 机动时间, 优化决策

Abstract: The sequential optimal decision of three parallel procedure chains is one of the focuses in the theory of project planning and control at present.Without considering every machine idle time,a new arithmetic is provided in view of slack job time per machine.It is feasible and easy to use through example,.

Key words: parallel procedure chain, idle time, activity float, optimal decision

中图分类号:

TB114.1

李星梅, 乞建勋, 牛东晓. 三个平行序链的顺序优化决策[J]. 中国管理科学, 2006, (4): 69-74.

LI Xing-mei, QI Jian-xun, NIU Dong-xiao. The sequential optimal decision of three parallel procedure chains[J]. Chinese Journal of Management Science, 2006, (4): 69-74.

参考文献

[1] 乞建勋.网络计划优化新理论与技术经济决策[M].北京:科学出版社,1997:16-64.
[2] 乞建勋.一般序偶的优化方法[J].华北电力学院学报,1988,(2):106-113.
[3] 乞建勋,王广庆.三元序链的优化理论[J].系统工程理论与实践,1991,(11):67-85.
[4] 乞建勋,关金锋.二行N元链格的优化方法[C].全国运筹学应用交流与研讨会论文集,1994.
[5] 唐国春,张峰,罗守成,刘丽丽.现代排序论[M].上海:上海科学普及出版社,2002,176-177.
[6] Talel Ladhari,Mohamed Haouan.A computational study of the permutation flow shop problem based on s tight lower bound[J].Computers & Operations Research,2005,32:1831-1847.
[7] Fouad Riane,Abdelhakim Artiba,Salah E.Elmaghraby.A hybrid three-stage flowshop problem:Efficient heuristics to minimize makespan[J].European Journal of Operational Research,1998,109:321-329.
[8] Jose M.Framinan,Rainer Leisten,Rafael Ruiz-Usano.Comparison of heuristics for flowtime minimization in permutation flowshops[J].Computers & Operations Research,2005,32:1237-1254.
[9] Chinyao Low.Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines[J].Computers & Operations Research,2005,32:2013 -2025.
[10] Jozef Grabowski,Jaroslaw Pempera.Some local search algorithm for no-wait flow-shop problem with makespan criterion[J].Computers & Operations Research,2005,32:2197-2212.
[11] Irene N.Lushchakova,Svetlana A.Kravchenko.Twomachine shop scheduling with zero and unit processing times[J].European Journal of Operational Research,1998,107:378-388.
[12] George Kyparisis,Christos Koulamas.Flow shop and open shop scheduling with a critical machine and two operations per job[J].European Journal of Operational Research,2000,127:120-125.
[13] Samuel Gorenstein.An Algorithm for Project (Job) Sequencing with Resource Constraints[J].Operations Research,1972,20(4):835-850.
[14] Edem O.P.Akpan.Job-shop sequencing problems via network scheduling technique[J].International Journal of Operations & Production Management,1996,16 (3):76-86.
[15] S.E.Elmaghraby.On criticality and sensitivity in activity networks[J].European Journal of Operational Research,2000,127:220-238.
[16] 蔡晨,万伟.基于PERT/CPM的关键链管理[J].中国管理科学,2003,11(6):70-75.