Flexible job-shop scheduling analysis and its heuristic algorithm
Flexible job-shop scheduling analysis and its heuristic algorithm
复制标题
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
Qiu Jingwei
中科院分区：
文献类型：
--
作者：
Qiu Jingwei
The multi-objective flexible job-shop scheduling problem is analyzed based on Gantt graph and experi-ence from building block, a composite priority rule and heuristic algorithm based on this priority rule are presented. This composite priority rule is for three scheduling targets including makespan, critical machine workload and total workload, changing the ratio of data items in the rule can adjust the ratio of the three scheduling targets. This heuris- tic algorithm randomly adjusts the ratio of this three scheduling targets, and slightly adjusts the ratio corresponding to the best solution, can randomly generate many excellent scheduling solutions. The algorithm’s comparison and test show that the result of this algorithm is more excellent. The algorithm runs rapidly and steadily, and can directly be used in generating initial solution in other scheduling algorithms or used in dynamic scheduling.
