IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-32539-0_25.html
   My bibliography  Save this book chapter

A Heuristic Method for Large-Scale Batch Scheduling in the Process Industries

In: Operations Research Proceedings 2005

Author

Listed:
  • Norbert Trautmann

    (Universität Bern)

  • Christoph Schwindt

    (TU Clausthal)

Abstract

Summary In the process industries, final products arise from chemical and physical transformations of materials on processing units. In batch production mode, the total requirements for intermediate and final products are divided into individual batches. Storage facilities of limited capacity are available for stocking raw materials, intermediates, and final products. We present a novel approach to solving large-scale instances of the minimum-makespan production scheduling problem. The basic idea consists in constructing a production schedule by concatenating copies of a cyclic subschedule. For generating an appropriate subschedule we formulate a mixed-integer nonlinear program providing the set of batches of one cycle and the number of cycles needed to satisfy the primary requirements. The subschedule is then obtained by allocating the processing units, intermediates, and storage facilities over time to the batches executed in the cycle.

Suggested Citation

  • Norbert Trautmann & Christoph Schwindt, 2006. "A Heuristic Method for Large-Scale Batch Scheduling in the Process Industries," Operations Research Proceedings, in: Hans-Dietrich Haasis & Herbert Kopfer & Jörn Schönberger (ed.), Operations Research Proceedings 2005, pages 155-160, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-32539-0_25
    DOI: 10.1007/3-540-32539-5_25
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:oprchp:978-3-540-32539-0_25. 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.