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

    Fingerprint

    Simulation Optimization
    Dispatching
    Dispatching Rules
    Job Shop
    Processing
    Simulation
    Due Dates
    Algorithm Design
    Alternatives
    Experimental Results

    ASJC Scopus subject areas

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

    Cite this

    Morito, S., & Lee, K. H. (1997). Efficient simulation/optimization of dispatching priority with `fake' processing time. In S. Andradottir, K. J. Healy, D. H. Withers, & B. L. Nelson (Eds.), Winter Simulation Conference Proceedings (pp. 872-879). IEEE.

    Efficient simulation/optimization of dispatching priority with `fake' processing time. / Morito, Susumu; Lee, Keun Hyung.

    Winter Simulation Conference Proceedings. ed. / S. Andradottir; K.J. Healy; D.H. Withers; B.L. Nelson. IEEE, 1997. p. 872-879.

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

    Morito, S & Lee, KH 1997, Efficient simulation/optimization of dispatching priority with `fake' processing time. in S Andradottir, KJ Healy, DH Withers & BL Nelson (eds), Winter Simulation Conference Proceedings. IEEE, pp. 872-879, Proceedings of the 1997 Winter Simulation Conference, Atlanta, GA, USA, 97/12/7.
    Morito S, Lee KH. Efficient simulation/optimization of dispatching priority with `fake' processing time. In Andradottir S, Healy KJ, Withers DH, Nelson BL, editors, Winter Simulation Conference Proceedings. IEEE. 1997. p. 872-879
    Morito, Susumu ; Lee, Keun Hyung. / Efficient simulation/optimization of dispatching priority with `fake' processing time. Winter Simulation Conference Proceedings. editor / S. Andradottir ; K.J. Healy ; D.H. Withers ; B.L. Nelson. IEEE, 1997. pp. 872-879
    @inproceedings{01c1a33755ff47ecb68574270a0255d9,
    title = "Efficient simulation/optimization of dispatching priority with `fake' processing time",
    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.",
    author = "Susumu Morito and Lee, {Keun Hyung}",
    year = "1997",
    language = "English",
    pages = "872--879",
    editor = "S. Andradottir and K.J. Healy and D.H. Withers and B.L. Nelson",
    booktitle = "Winter Simulation Conference Proceedings",
    publisher = "IEEE",

    }

    TY - GEN

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

    AU - Morito, Susumu

    AU - Lee, Keun Hyung

    PY - 1997

    Y1 - 1997

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=0031374260&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0031374260&partnerID=8YFLogxK

    M3 - Conference contribution

    SP - 872

    EP - 879

    BT - Winter Simulation Conference Proceedings

    A2 - Andradottir, S.

    A2 - Healy, K.J.

    A2 - Withers, D.H.

    A2 - Nelson, B.L.

    PB - IEEE

    ER -