Exploration of a minimum tardiness dispatching priority for a flexible manufacturing system - a combined simulation / optimization approach

Susumu Morito, Keun Hyung Lee, Kiyohisa Mizoguchi, Hiroshi Awane

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

    4 Citations (Scopus)

    Abstract

    This paper presents a simulation-optimization approach to find an appropriate dispatching priority. The study is based on a detailed simulator for a module-type commercial FMS. Specifically, after presenting the basic configuration and fundamental control logic of the system together with its main characteristics as a special type of a job shop, an algorithm is presented which combines simulated annealing and simulation to explore a dispatching priority of operations that minimizes the total tardiness. Computational performance of the algorithm is presented which shows that good solutions can be obtained mostly after 300 iterations or so. The paper also compares the performance of the 'optimal' or near optimal dispatching priority generated by the proposed algorithm with those generated by standard dispatching rules. The results show that standard dispatching rules such as EDD and SLACK which take due dates into considerations perform moderately, but not extremely well. The results also show that some of the workload-based dispatching rules such as SPT work consistently well.

    Original languageEnglish
    Title of host publicationWinter Simulation Conference Proceedings
    EditorsGerald W. Evans, Mansooren Mollaghasemi, Edward C. Russell, William E. Biles
    Place of PublicationPiscataway, NJ, United States
    PublisherPubl by IEEE
    Pages829-836
    Number of pages8
    ISBN (Print)0780313801
    Publication statusPublished - 1993

    Fingerprint

    Dispatching Rules
    Simulation Optimization
    Flexible Manufacturing Systems
    Dispatching
    Flexible manufacturing systems
    Tardiness
    Total Tardiness
    Job Shop
    Due Dates
    Simulated annealing
    Simulated Annealing
    Workload
    Simulator
    Simulators
    Logic
    Minimise
    Iteration
    Module
    Configuration
    Simulation

    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., Mizoguchi, K., & Awane, H. (1993). Exploration of a minimum tardiness dispatching priority for a flexible manufacturing system - a combined simulation / optimization approach. In G. W. Evans, M. Mollaghasemi, E. C. Russell, & W. E. Biles (Eds.), Winter Simulation Conference Proceedings (pp. 829-836). Piscataway, NJ, United States: Publ by IEEE.

    Exploration of a minimum tardiness dispatching priority for a flexible manufacturing system - a combined simulation / optimization approach. / Morito, Susumu; Lee, Keun Hyung; Mizoguchi, Kiyohisa; Awane, Hiroshi.

    Winter Simulation Conference Proceedings. ed. / Gerald W. Evans; Mansooren Mollaghasemi; Edward C. Russell; William E. Biles. Piscataway, NJ, United States : Publ by IEEE, 1993. p. 829-836.

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

    Morito, S, Lee, KH, Mizoguchi, K & Awane, H 1993, Exploration of a minimum tardiness dispatching priority for a flexible manufacturing system - a combined simulation / optimization approach. in GW Evans, M Mollaghasemi, EC Russell & WE Biles (eds), Winter Simulation Conference Proceedings. Publ by IEEE, Piscataway, NJ, United States, pp. 829-836.
    Morito S, Lee KH, Mizoguchi K, Awane H. Exploration of a minimum tardiness dispatching priority for a flexible manufacturing system - a combined simulation / optimization approach. In Evans GW, Mollaghasemi M, Russell EC, Biles WE, editors, Winter Simulation Conference Proceedings. Piscataway, NJ, United States: Publ by IEEE. 1993. p. 829-836
    Morito, Susumu ; Lee, Keun Hyung ; Mizoguchi, Kiyohisa ; Awane, Hiroshi. / Exploration of a minimum tardiness dispatching priority for a flexible manufacturing system - a combined simulation / optimization approach. Winter Simulation Conference Proceedings. editor / Gerald W. Evans ; Mansooren Mollaghasemi ; Edward C. Russell ; William E. Biles. Piscataway, NJ, United States : Publ by IEEE, 1993. pp. 829-836
    @inproceedings{95b61763689746078c09b11580e8ac23,
    title = "Exploration of a minimum tardiness dispatching priority for a flexible manufacturing system - a combined simulation / optimization approach",
    abstract = "This paper presents a simulation-optimization approach to find an appropriate dispatching priority. The study is based on a detailed simulator for a module-type commercial FMS. Specifically, after presenting the basic configuration and fundamental control logic of the system together with its main characteristics as a special type of a job shop, an algorithm is presented which combines simulated annealing and simulation to explore a dispatching priority of operations that minimizes the total tardiness. Computational performance of the algorithm is presented which shows that good solutions can be obtained mostly after 300 iterations or so. The paper also compares the performance of the 'optimal' or near optimal dispatching priority generated by the proposed algorithm with those generated by standard dispatching rules. The results show that standard dispatching rules such as EDD and SLACK which take due dates into considerations perform moderately, but not extremely well. The results also show that some of the workload-based dispatching rules such as SPT work consistently well.",
    author = "Susumu Morito and Lee, {Keun Hyung} and Kiyohisa Mizoguchi and Hiroshi Awane",
    year = "1993",
    language = "English",
    isbn = "0780313801",
    pages = "829--836",
    editor = "Evans, {Gerald W.} and Mansooren Mollaghasemi and Russell, {Edward C.} and Biles, {William E.}",
    booktitle = "Winter Simulation Conference Proceedings",
    publisher = "Publ by IEEE",

    }

    TY - GEN

    T1 - Exploration of a minimum tardiness dispatching priority for a flexible manufacturing system - a combined simulation / optimization approach

    AU - Morito, Susumu

    AU - Lee, Keun Hyung

    AU - Mizoguchi, Kiyohisa

    AU - Awane, Hiroshi

    PY - 1993

    Y1 - 1993

    N2 - This paper presents a simulation-optimization approach to find an appropriate dispatching priority. The study is based on a detailed simulator for a module-type commercial FMS. Specifically, after presenting the basic configuration and fundamental control logic of the system together with its main characteristics as a special type of a job shop, an algorithm is presented which combines simulated annealing and simulation to explore a dispatching priority of operations that minimizes the total tardiness. Computational performance of the algorithm is presented which shows that good solutions can be obtained mostly after 300 iterations or so. The paper also compares the performance of the 'optimal' or near optimal dispatching priority generated by the proposed algorithm with those generated by standard dispatching rules. The results show that standard dispatching rules such as EDD and SLACK which take due dates into considerations perform moderately, but not extremely well. The results also show that some of the workload-based dispatching rules such as SPT work consistently well.

    AB - This paper presents a simulation-optimization approach to find an appropriate dispatching priority. The study is based on a detailed simulator for a module-type commercial FMS. Specifically, after presenting the basic configuration and fundamental control logic of the system together with its main characteristics as a special type of a job shop, an algorithm is presented which combines simulated annealing and simulation to explore a dispatching priority of operations that minimizes the total tardiness. Computational performance of the algorithm is presented which shows that good solutions can be obtained mostly after 300 iterations or so. The paper also compares the performance of the 'optimal' or near optimal dispatching priority generated by the proposed algorithm with those generated by standard dispatching rules. The results show that standard dispatching rules such as EDD and SLACK which take due dates into considerations perform moderately, but not extremely well. The results also show that some of the workload-based dispatching rules such as SPT work consistently well.

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

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

    M3 - Conference contribution

    AN - SCOPUS:0027844572

    SN - 0780313801

    SP - 829

    EP - 836

    BT - Winter Simulation Conference Proceedings

    A2 - Evans, Gerald W.

    A2 - Mollaghasemi, Mansooren

    A2 - Russell, Edward C.

    A2 - Biles, William E.

    PB - Publ by IEEE

    CY - Piscataway, NJ, United States

    ER -