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

An Extensive Tabu Search Algorithm for Solving the Lot Streaming Problem in a Job Shop Environment

In: Operations Research Proceedings 2007

Author

Listed:
  • Liji Shen

    (Dresden University of Technology)

Abstract

The purpose of this paper is to solve the lot streaming problem in job shop scheduling systems, where both equal and consistent sublots are considered. The presented algorithm incorporates a tabu search procedure to determine schedules and a specific heuristic for improving sublot sizes. Computational results confirm that, by applying the lot streaming strategy, production can be significantly accelerated. Moreover, this algorithm yields superior solutions compared to various approaches proposed in the literature and all tested instances show a rapid convergence to their lower bounds.

Suggested Citation

  • Liji Shen, 2008. "An Extensive Tabu Search Algorithm for Solving the Lot Streaming Problem in a Job Shop Environment," Operations Research Proceedings, in: Jörg Kalcsics & Stefan Nickel (ed.), Operations Research Proceedings 2007, pages 49-54, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-77903-2_8
    DOI: 10.1007/978-3-540-77903-2_8
    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.

    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-77903-2_8. 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.