IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v70y1997i0p191-22010.1023-a1018922104670.html
   My bibliography  Save this article

Stochastic scheduling of a batch processing machine with incompatible job families

Author

Listed:
  • Izak Duenyas
  • John Neale

Abstract

We consider the control of a single batch processing machine with random processing times and incompatible job families (jobs from different families cannot be processed together in the same batch). Holding costs are incurred for each unit of time that a job waits in the system before being served, and the objective is to minimize the long-run average cost per unit time. We first determine optimal policies for the static problem where all jobs are available simultaneously. We next characterize the optimal policies for certain problems with dynamic arrivals of jobs under the restriction that the machine is not allowed to idle. Finally, we develop a simple heuristic scheduling policy to control the machine. Simulation results are provided to demonstrate the effectiveness of our heuristic over a wide range of problem instances and to compare its performance with existing heuristics. Copyright Kluwer Academic Publishers 1997

Suggested Citation

  • Izak Duenyas & John Neale, 1997. "Stochastic scheduling of a batch processing machine with incompatible job families," Annals of Operations Research, Springer, vol. 70(0), pages 191-220, April.
    • Handle: RePEc:spr:annopr:v:70:y:1997:i:0:p:191-220:10.1023/a:1018922104670
    DOI: 10.1023/A:1018922104670
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018922104670
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018922104670?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    2. Zee, Durk Jouke van der, 2002. "Look-ahead strategies for controlling batch operations in industry : basic insights in rule construction," Research Report 02A68, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    3. repec:dgr:rugsom:02a68 is not listed on IDEAS
    4. Hekimoğlu, Mustafa & van der Laan, Ervin & Dekker, Rommert, 2018. "Markov-modulated analysis of a spare parts system with random lead times and disruption risks," European Journal of Operational Research, Elsevier, vol. 269(3), pages 909-922.
    5. Koh, Shie-Gheun & Koo, Pyung-Hoi & Kim, Dong-Chun & Hur, Won-Suk, 2005. "Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families," International Journal of Production Economics, Elsevier, vol. 98(1), pages 81-96, October.

    More about this item

    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:spr:annopr:v:70:y:1997:i:0:p:191-220:10.1023/a:1018922104670. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.