全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

求解同顺序加工调度问题的一种启发式方法

, PP. 0-0

Keywords: 同顺序加工调度问题

Full-Text   Cite this paper   Add to My Lib

Abstract:

为了更加有效地求解同顺序加工调度问题,分析了现有启发式求解方法,发现影响解的质量的主要因素是调整近似解的方法和初始解,其中调整近似解的方法对解的质量影响较大。对此,提出了一种新的启发式方法。新方法中的调整方法考虑了调整对最短总加工时间的影响,调整任意给定的近似解不会降低解的质量,经过迭代运算,可以逐步改善近似解;新方法采用了多起点策略,利用调整方法调整不同初始解,选取最好的近似解作为问题的解,从而减小了初始解对问题解的质量的影响。实验结果表明,这种方法是有效的。

References

[1]  WEI Youshuang, YANG Xianglong, FENG Yuncheng. Heuristic algorithms for flow shop scheduling problem[J]. System Engineering Theory and Practice, 2000,(9):41-47(in Chinese).[韦有双,杨湘龙,冯允成.一种新的求解Flow-shop问题的启发式方法[J].系统工程理论与实践,2000,(9):41-47.]
[2]  NAWAZ M, ENSCORE E Jr, HAM I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem[J]. Omega, 1983, 11(1):9-95.
[3]  PALMER D S.Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum[J]. Opserations Research Quarterly, 1965,16(1):101-107.
[4]  SHEN Yingjun, HUANG Haijun, WU Sa,et al. New scheduling heuristic for the permutation flow-shop problem[J]. Journal of Beijing University of Aeronautics and Astronautic,1998,24(1):83-87(in Chinese).[沈英俊,黄海军,吴飒,等.一种求解同顺序Flow shop排序问题的新的启发式算法[J].北京航空航天大学学报,1998, 24(1):83-87.]
[5]  ANDREW L T. No optimization without representation:a knowledge based systems view of evolutionary/neighborhood search optimization[D]. Scotland,U.K.:University of Edinburgh,1999.18-19.
[6]  DIRK C,MATTFELD ROB J M V. Flowshopinfo.txt [EB/ OL]. http://mscmga.ms.ic.ac.uk/ueb/orlib/.
[7]  WANG Ling. Intelligent optimization algorithms with applications[M]. Bejing:Tsinghua University Press,Springer Press,2001.159-160(in Chinese).[王凌.智能优化算法及其应用[M].北京:清华大学出版社 ,施普林格出版社,2001.159-160.]
[8]  JOHNSON S M. Optimal two- and three-stage production schedules with setup times included[J]. Naval Research Logistics Quarterly, 1954,1(1):61-68.
[9]  GAREY M, JOHNSON D,SETHI R.The complexity of flow shop and job shop scheduling[J]. Mathematics of Operations Reseach,1976,1(2):117-129.
[10]  WANG Ling, ZHENG Dazhong. An improved genetic algorithm to solve permutation scheduling problem[J]. System Engineering Theory and Practice,2002,(6):74-79(in Chinese). [王凌,郑大钟.求解同顺 序加工调度问题的一种改进遗传算法[J].系统工程理论与实践,2002,(6):74-79.]
[11]  CHEN Xiong, TANG Guangqiang, WU Qidi. Genetic algorithm for three-machine flow-shop scheduling problem[J]. Journal of Tongji University, 2001, 29(8):940-945(in Chinese).[陈雄,汤光强,吴启迪 ,一种求解3机flow-shop调度问题的遗传算法[J].同济大学学报,2001, 29(8):940-945.]
[12]  WANG Wanliang, WU Qidi. A new method solving job-shop scheduling problems based on hopfield neural networks[J]. Computer Integrated Manufacturing Systems,2001,7(12):7-12(in Chinese).[王万良,吴启迪.基于Hopfield神经网络求解作业车间调度问题的新方法[J].计算机集成制造系统,2001,7(12):7-12.]

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133