全部 标题 作者
关键词 摘要

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

查看量下载量

相关文章

更多...

一种不确定条件下的多目标流水车间调度优化算法

, PP. 101-107

Keywords: 不确定性,流水车间调度,多目标优化,遗传算法

Full-Text   Cite this paper   Add to My Lib

Abstract:

实际中大多数生产调度问题具有多目标优化的性质,本文讨论在不确定加工时间和机器故障的情况下,如何优化多目标流水车间调度问题.首先设计最大流程时间和最大延迟时间两类指标的求解方法,在此基础上提出一种多目标遗传算法,用来迭代求解不确定条件下两类目标的最优化问题.模拟实验的结果表明,本文算法方案可较好解决不确定条件下的流水车间调度问题.

References

[1]  Cui Xunxue. Multi-Objective Evolution Algorithm and Its Application. Beijing, China: Defense Industry Press, 2006 (in Chinese) (崔逊学.多目标进化算法及其应用.北京:国防工业出版社, 2006)
[2]  Wang Ling. Shop Scheduling with Genetic Algorithms. Beijing, China: Tsinghua University Press, 2003 (in Chinese) (王 凌.车间调度及其遗传算法.北京:清华大学出版社, 2003)
[3]  Allahverdi A, Mittenthal J. Scheduling on a Two-Machine Flowshop Subject to Random Breakdowns with a Makespan Objective Function. European Journal of Operational Research, 1995, 81(2): 376-387
[4]  Alcaide D, Rodriguez-Gonzalez A, Sicilia J. An Approach to Solve the Minimum Expected Makespan Flow-Shop Problem Subject to Breakdowns. European Journal of Operational Research, 2002, 140(2): 384-398
[5]  Alcaide D, Rodriguez-Gonzalez A, Sicilia J. A Heuristic Approach to Minimize Expected Makespan in Open Shops Subject to Stochastic Processing Times and Failures. International Journal of Flexible Manufacturing Systems, 2005, 17(3): 201-226
[6]  Li Zukui, Ierapetritou M. Process Scheduling under Uncertainty: Review and Challenges. Computers and Chemical Engineering, 2008, 32(4/5): 715-727
[7]  Ripon K S N, Tsang C, Kwong S. An Evolutionary Approach for Solving the Multi-Objective Job-Shop Scheduling Problem // Bunke H, Kandel A, eds. Studies in Computational Intelligence. Berlin, Germany: Springer, 2007, 49: 165-195
[8]  Ruiz R, Maroto C, Alcaraz J. Two New Robust Genetic Algorithms for the Flowshop Scheduling Problem. Omega, 2006, 34(5): 461-476
[9]  Fonseca C M, Fleming P J. Genetic Algorithms for Multi-Objective Optimization: Formulation, Discussion and Generalization //Proc of the 5th International Conference on Genetic Algorithms. Chicago, USA, 1993: 416-423

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133