Efficient simulation/optimization of dispatching priority with `fake' processing time

Susumu Morito, Keun Hyung Lee

    研究成果: Conference contribution

    9 被引用数 (Scopus)

    抄録

    An efficient simulation/optimization approach is presented for finding a dynamic dispatching priority in a static job shop environment under the presence of multiple identical jobs. The key ingredients of the proposed approach are (1) an efficient processing-time-based dispatching rule, (2) simulation of a job shop, and (3) a mechanism to `fake' (or modify) job processing times based on the information of job slack obtained from simulation. The paper presents an overall approach to fake processing times, and also identifies alternative strategies for algorithm design. Experimental results of the proposed approach yield a dispatching priority with more than 10% better due date performance than the priority generated by a good processing-time-based dispatching rule in roughly 20 simulation runs.

    本文言語English
    ホスト出版物のタイトルWinter Simulation Conference Proceedings
    編集者S. Andradottir, K.J. Healy, D.H. Withers, B.L. Nelson
    出版社IEEE
    ページ872-879
    ページ数8
    出版ステータスPublished - 1997
    イベントProceedings of the 1997 Winter Simulation Conference - Atlanta, GA, USA
    継続期間: 1997 12 71997 12 10

    Other

    OtherProceedings of the 1997 Winter Simulation Conference
    CityAtlanta, GA, USA
    Period97/12/797/12/10

    ASJC Scopus subject areas

    • 化学的な安全衛生
    • ソフトウェア
    • 安全性、リスク、信頼性、品質管理
    • 応用数学
    • モデリングとシミュレーション

    フィンガープリント

    「Efficient simulation/optimization of dispatching priority with `fake' processing time」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル