应用强化学习算法求解置换流水车间调度问题  

Reinforcement Learning Algorithm for Permutation Flow Shop Scheduling to Minimize Makespan

作　　者：张东阳 叶春明[1] ZHANG Dong-Yang;YE Chun-Ming(Business School,University of Shanghai for Science and Technology,Shanghai 200093,China)

机构地区：[1]上海理工大学管理学院

出　　处：《计算机系统应用》2019年第12期195-199,共5页Computer Systems & Applications

基　　金：国家自然科学基金(71840003);上海理工大学科技发展项目(2018KJFZ043)~~

摘　　要：面对日益增长的大规模调度问题,新型算法的开发越显重要.针对置换流水车间调度问题,提出了一种基于强化学习Q-Learning调度算法.通过引入状态变量和行为变量,将组合优化的排序问题转换成序贯决策问题,来解决置换流水车间调度问题.采用所提算法对OR-Library提供Flow-shop国际标准算例进行测试,并与已有的一些算法对比,结果表明算法的有效性.In the face of increasing large-scale scheduling problems,the development of new algorithms becomes more and more important.A Q-Learning scheduling algorithm based on reinforcement learning is proposed for permutation flow shop scheduling problem.By introducing state variables and behavior variables,the scheduling problem of combinatorial optimization is transformed into sequential decision-making problem to solve the permutation flow shop scheduling problem.The proposed algorithm is used to test the Flow-shop international standard provided by OR-Library,and compared with some existing algorithms,the results show that the algorithm is effective.

关 键 词：置换流水车间调度 强化学习 Q-LEARNING 最大完工时间 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程] O223[自动化与计算机技术—控制科学与工程] F273[理学—运筹学与控制论]