顾幸生;丁豪杰;

• 1:华东理工大学信息科学与工程学院

摘要(Abstract)：

对柔性作业车间调度问题的研究可以令实际生产加工过程更加贴合当今人们对商品个性化和定制化方面的需求。在对柔性作业车间调度问题中的多个性能评价指标进行研究后,巧妙利用它们间的矛盾点,在自创的问题编、解码方案的基础之上,建立了博弈解集,并对传统粒子群算法的寻优机制进行改进,提出了改进博弈粒子群算法。运用该算法对一组标准问题调度算例进行求解,验证了该算法良好的求解性能。同时,通过与其他粒子群算法结果和耗时等的比对显示该算法可以更有效地求解以最小化最大完工时间作为唯一优化目标的柔性作业车间调度问题。

关键词(KeyWords)： 柔性作业车间调度问题;粒子群算法;关键工序;最优化;智能决策

Abstract:

Keywords:

基金项目(Foundation): 国家自然科学基金(61973120,61573144,61773165,61673175)

作者(Author): 顾幸生;丁豪杰;

Email:

DOI:

参考文献(References)：

• [1] PINEDO L M. Scheduling theory,algorithms,and systems[M].5th ed. New York:Springer,2016.
• [2]连志刚.制造业信息化管控设计与优化[M].上海：上海科学普及出版社，2016.LIANG Zhigang. Design and optimization of informationization management and control of manufacturing industry[M]. Shanghai:Shanghai Science Popularization Press,2016.
• [3] ANDRADE-P J L,CANCA D,GONZALEZ-R P L,et al.Scheduling a dual-resource flexible job shop with makespan and due date-related criteria[J]. Annals of Operations Research,2020,291:5.
• [4] PELLERIN R,PERRIER N,BERTHAUT F. A survey of hybrid metaheuristics for the resource-constrained project scheduling problem[J]. European Journal of Operational Research,2020,280(2):395.
• [5] MESGHOUNI K,HAMMADI S,BORNE P. Evolution programs for job-shop scheduling[C]//IEEE International Conference on Systems,Man,and Cybernetics. Computational Cybernetics and Simulation.[S.l.]:IEEE,1997:720-725.
• [6] ONG Z X,TAY J C,KWOH C K. Applying the clonal selection principle to find flexible job-shop schedules[C]//Artificial Immune Systems,ICARIS 2005. Berlin:Springer,2005,3627:442-455.
• [7] ZRIBI N,KACEM I,KAMEL A E,et al. Assignment and scheduling in flexible job-shops by hierarchical optimization[J].IEEE Transactions on Systems,Man and Cybernetics,Part C(Applications and Reviews),2007,37(4):652.
• [8] TAY J C,HO N B. Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems[J]. Computers&Industrial Engineering,2008,54(3):453.
• [9] LIOUANE N,SAAD I,HAMMADI S,et al. Ant systems and local search optimization for flexible job shop scheduling production[J]. International Journal of Computers,Communications&Control,2007,2(2):174.
• [10] GIRISH B S,JAWAHAR N. A particle swarm optimization algorithm for flexible job shop scheduling problem[C]//IEEE International Conference on Automation Science and Engineering.Bangalore:IEEE,2009:298-303.
• [11] NOUIRI M,BEKRAR A,JEMAI A,et al. An effective and distributed particle swarm optimization algorithm for flexible jobshop scheduling problem[J]. Journal of Intelligent Manufacturing,2018,29:603
• [12] LU Chao,LI Xinyu,GAO Liang,et al. An effective multiobjective discrete virus optimization algorithm for flexible job-shop scheduling problem with controllable processing times[J].Computers&Industrial Engineering,2017,104:156.
• [13] ZHOU Yanping,GU Xingsheng. One machine sequencing game with lateness penalties[J]. International Journal on Information,2012,15(11):4429.
• [14]顾幸生，潘晔，卢胜利.基于改进支持向量机的作物叶水势软测量建模[J].同济大学学报（自然科学版），2010,38(11):1669.GU Xingsheng,PAN Ye,LU Shengli. Modeling of crop leaf water potential soft sensor based on improved support vector machine[J]. Journal of Tongji University(Natural Science),2010,38(11):1669.
• [15] BRANDIMARTE P. Routing and scheduling in a flexible job shop by tabu search[J]. Annals of Operations Research,1993,41(3):157.
• [16] CLERC M. Particle swarm optimization[M]. London:ISTE Ltd,2006.
• [17] DING Haojie, GU Xingsheng. Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem[J]. Computers&Operations Research,2020,121(9):104951.