Dispatching rules for dynamic scheduling of one-of-a-kind production

Cited 25 time in webofscience Cited 0 time in scopus
  • Hit : 356
  • Download : 0
This paper presents an extensive performance analysis of dispatching rules for dynamic scheduling in one-of-a-kind production (OKP) where each job has its own due-date and multilevel routing structure. For the analysis, a framework of dynamic dispatching rules is proposed to identify five dispatching rules: job due-date (JDD) rule, normalized JDD rule, latest finish date (LFD) rule, latest start date (LSD) rule, and refined LSD rule. The performance analysis shows that: (i) JDD, LFD and LSD rules perform fairly well, which is compatible with the results of existing studies; (ii) the refined LSD rule outperforms other rules; (iii) the normalized JDD rule performs very poorly. Also presented is a framework of simulation-based dynamic scheduling in which the refined LSD as well as the 'try-every-rule' approach can be effectively utilized.
Publisher
TAYLOR & FRANCIS LTD
Issue Date
2006-06
Language
English
Article Type
Article
Keywords

ASSEMBLY JOB-SHOPS; ASSIGNMENT PROCEDURES; SEQUENCING RULES; TARDINESS

Citation

INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, v.19, pp.383 - 392

ISSN
0951-192X
DOI
10.1080/09511920500407541
URI
http://hdl.handle.net/10203/90840
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 25 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0