Dynamic Scheduling of Flexible Job Shops |
| |
Authors: | SHAHID Ikramullah Butt and SUN Hou-fang |
| |
Affiliation: | School of Mechanical and Vehicular Engineering, Beijing Institute of Technology, Beijing 100081, China;School of Mechanical and Vehicular Engineering, Beijing Institute of Technology, Beijing 100081, China |
| |
Abstract: | Aim of this research is to minimize makespan in the flexible job shop environment by the use of genetic algorithms and scheduling rules.Software is developed using genetic algorithms and scheduling rules based on certain constraints such as non-preemption of jobs,recirculation,set up times,non-breakdown of machines etc.Purpose of the software is to develop a schedule for flexible job shop environment,which is a special case of job shop scheduling problem.Scheduling algorithm used in the software is verified and tested by using MT10 as benchmark problem,presented in the flexible job shop environment at the end.LEKIN(R) software results are also compared with results of the developed software by the use of MT10 benchmark problem to show that the latter is a practical software and can be used successfully at BIT Training Workshop. |
| |
Keywords: | flexible job shop scheduling genetic algorithms scheduling rules |
本文献已被 CNKI 维普 万方数据 等数据库收录! |
| 点击此处可从《北京理工大学学报(英文版)》浏览原始摘要信息 |
|
点击此处可从《北京理工大学学报(英文版)》下载全文 |