文章基本信息

标题：Dynamic Priority Rule Selection for Solving Multi-objective Job Shop Scheduling Problems
本地全文：下载
作者：Aydin Teymourifar ; Ozan Bahadir ; Gurkan Ozturk 等
期刊名称：Universal Journal of Industrial and Business Management
印刷版ISSN：2332-3310
电子版ISSN：2332-3329
出版年度：2018
卷号：6
期号：1
页码：11-22
DOI：10.13189/ujibm.2018.060102
语种：English
出版社：Horizon Research Publishing
摘要：In this paper, a new approach has been suggested for solving the multi-objective job shop scheduling problem, in which, simple priority rules are used dynamically, according to the varied state of the scheduling environment. The rules assign priority to the jobs that waiting in queues based on their features and/or the scheduling environment. Since the real scheduling environments are generally dynamic, it is better to use different rules during the scheduling according to the state of the shop floor at each decision time. Based on this approach, a new algorithm is designed, which uses different rules over the scheduling time. This approach can be easily applied to solve the real scheduling problems of the manufacturing systems. The algorithm has been compared with some classic rules from the literature. The results show that the proposed approach is more effective than using a fixed priority rule.
关键词：Job Shop Scheduling Problem;Dynamic Priority Rule Selection;Multi-objective Optimization