Universal Journal of Industrial and Business Management Vol. 6(1), pp. 11 - 22
DOI: 10.13189/ujibm.2018.060102
Reprint (PDF) (380Kb)


Dynamic Priority Rule Selection for Solving Multi-objective Job Shop Scheduling Problems


Aydin Teymourifar 1,2,*, Ozan Bahadir 1,2, Gurkan Ozturk 1,2
1 Faculty of Engineering, Anadolu University, 26555, Eskisehir, Turkey
2 Computational Intelligence and Optimization Laboratory (CIOL), Anadolu University, 26555, Eskisehir, Turkey

ABSTRACT

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.

KEYWORDS
Job Shop Scheduling Problem, Dynamic Priority Rule Selection, Multi-objective Optimization

Cite this paper
Aydin Teymourifar , Ozan Bahadir , Gurkan Ozturk . "Dynamic Priority Rule Selection for Solving Multi-objective Job Shop Scheduling Problems." Universal Journal of Industrial and Business Management 6.1 (2018) 11 - 22. doi: 10.13189/ujibm.2018.060102.