计算机工程与应用2012，Vol.48Issue(10)：233-237,5.DOI:10.3778/j.issn.1002-8331.2012.10.053
柔性作业车间调度分析及其启发式算法
Flexible job-shop scheduling analysis and its heuristic algorithm
苏子林 1苑金梁 1陈炜 2邱景炜1
作者信息
- 1. 鲁东大学交通学院,山东烟台264025
- 2. 宁夏公路管理局,银川750004
- 折叠
摘要
Abstract
The multi-objective flexible job-shop scheduling problem is analyzed based on Gantt graph and experience 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 heuristic 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.关键词
柔性作业车间调度/优先规则/启发式算法Key words
flexible job shop scheduling/ priority rule/ heuristic algorithm分类
信息技术与安全科学引用本文复制引用
苏子林,苑金梁,陈炜,邱景炜..柔性作业车间调度分析及其启发式算法[J].计算机工程与应用,2012,48(10):233-237,5.
