New dispatching rules and due date assignment models for dynamic job shop scheduling problems Online publication date: Wed, 03-Oct-2018
by Aydin Teymourifar; Gurkan Ozturk
International Journal of Manufacturing Research (IJMR), Vol. 13, No. 4, 2018
Abstract: 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. [Submitted 17 August 2016; Accepted 14 November 2017]
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Manufacturing Research (IJMR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook