IDEAS home Printed from https://ideas.repec.org/p/sek/iacpro/1003786.html
   My bibliography  Save this paper

A loading decision for batch processors with continuous job arrivals

Author

Listed:
  • Pyung Hoi Koo

    (Pukyong National University)

Abstract

Batch processors processes a number of jobs simultaneously as a batch. Examples of batch processors include oven, shuttle bus, amusement park rides, and so on. When a batch processor completes its task and has some near-future job arrival information, a loading decision should be made whether to start the process right away or to wait for the upcoming jobs. This presentation introduces a look-ahead loading procedure for batch processors, where multiple job types are available, with the objective of average tardiness minimization. The distinct characteristics of the proposed procedure is that it takes advantage of the due-date of current jobs in queue as well as the due-date of upcoming jobs, the fixed number of look-ahead reduces the opportunity of being affected by the next job arrivals, and unlike the existing control policies, even when the number of jobs in queue is greater than capacity, loading can be delayed for more urgent jobs. The performance of the proposed control strategy is validated with simulation experiments.

Suggested Citation

  • Pyung Hoi Koo, 2015. "A loading decision for batch processors with continuous job arrivals," Proceedings of International Academic Conferences 1003786, International Institute of Social and Economic Sciences.
    • Handle: RePEc:sek:iacpro:1003786
    as

    Download full text from publisher

    File URL: https://iises.net/proceedings/international-academic-conference-rome/table-of-content/detail?cid=10&iid=101&rid=3786
    File Function: First version, 2015
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    batch processor; loading decision; look-ahead; tardiness minimization;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision Theory

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sek:iacpro:1003786. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Klara Cermakova (email available below). General contact details of provider: https://iises.net/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.