New dispatching rules and due date assignment models for dynamic job shop scheduling problems
Özet
In this paper, new due date assignment models and dispatching rules have been designed for the dynamic job shop scheduling problem. All of them have competitive results compared to the models from previous studies. The proposed dispatching rules have been evolved based on the modified and composite features of jobs. They have been compared with successful methods from the literature in a simulated environment. The simulation model has been validated by comparing the results with an analytical method. One of the rules has the best results in comparison with the other dispatching rules from the literature cited in this study. Another important matter which is considered in this paper is that the due date assignment model must be compatible with the used dispatching rule. Based on this approach, new due date assignment models are developed, which have the best results when combined with some dispatching rules. Copyright © 2018 Inderscience Enterprises Ltd.
