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

Susumu Morito, Keun Hyung Lee

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    9 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    Title of host publicationWinter Simulation Conference Proceedings
    EditorsS. Andradottir, K.J. Healy, D.H. Withers, B.L. Nelson
    PublisherIEEE
    Pages872-879
    Number of pages8
    Publication statusPublished - 1997
    EventProceedings of the 1997 Winter Simulation Conference - Atlanta, GA, USA
    Duration: 1997 Dec 71997 Dec 10

    Other

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

    ASJC Scopus subject areas

    • Chemical Health and Safety
    • Software
    • Safety, Risk, Reliability and Quality
    • Applied Mathematics
    • Modelling and Simulation

    Fingerprint Dive into the research topics of 'Efficient simulation/optimization of dispatching priority with `fake' processing time'. Together they form a unique fingerprint.

    Cite this