个人信息Personal Information
副教授
硕士生导师
性别:女
毕业院校:法国里尔中央理工大学
学位:博士
所在单位:交通运输系
学科:交通运输规划与管理
办公地点:大连理工大学土木实验4号楼516房间
电子邮箱:lian.lian@dlut.edu.cn
Evolutional Algorithm in Solving Flexible Job Shop Scheduling Problem with Uncertainties
点击次数:
论文类型:会议论文
发表时间:2015-01-01
收录刊物:CPCI-S
页面范围:1009-1015
关键字:Condition based maintenance; Flexible job shop scheduling problem; Genetic algorithm; Ant colony optimization; Artificial bee algorithm
摘要:In recent years, the necessity of considering uncertainty in scheduling problem is recognized by many scholars and practitioners, but there are still not effective methods to deal with uncertainty. This paper focuses on the flexible job shop scheduling problem (FJSP). Uncertainties in FJSP includes many aspects, such as the urgently arrival jobs, the uncertain working condition of the machines, etc. In this paper, we propose an inserting algorithm (IA), which can be used to treat the necessary machine maintenance for reducing unavailability of machines. We use the condition based maintenance (CBM) to reduce unavailability of machines. A problem focused in this paper is the flexible job shop scheduling problem with preventive maintenance (FJSPPM). An inserting algorithm (IA) is utilized to add PM into a preschedule scheme of FJSP which is obtained through an evolutional algorithm. Furthermore, a new better solution for an instance in benchmark of FJSP is obtained.