Please use this identifier to cite or link to this item:
|Title:||Dynamic selection of dispatching rules for job shop scheduling||Authors:||Subramaniam, V.
|Keywords:||Analytic hierarchy process and dispatching rules
|Issue Date:||Jan-2000||Citation:||Subramaniam, V., Lee, G.K., Hong, G.S., Wong, Y.S., Ramesh, T. (2000-01). Dynamic selection of dispatching rules for job shop scheduling. Production Planning and Control 11 (1) : 73-81. ScholarBank@NUS Repository. https://doi.org/10.1080/095372800232504||Abstract:||Although the academic contribution to job shop scheduling is abundant, its impact on practice has been minimal. The most preferred approach to job shop scheduling in the industry is dispatching rules. A major criticism against dispatching rules is that there is no single universal rule. The effective choice of dispatching rules depends on the scheduling criterion and existing job shop conditions. In this paper, the authors have proposed a scheduling method based on the analytic hierarchy process, that dynamically selects the most appropriate dispatching rule from several candidate rules. The selection is based on the existing job shop conditions. This method is applied to two formal job shop problems, and the results for single dispatching rules are inferior to the method proposed in this paper.||Source Title:||Production Planning and Control||URI:||http://scholarbank.nus.edu.sg/handle/10635/58137||ISSN:||09537287||DOI:||10.1080/095372800232504|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 9, 2019
WEB OF SCIENCETM
checked on Mar 26, 2019
checked on May 31, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.