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

Moving Bins from Conveyor Belts onto Pallets Using FIFO Queues

In: Operations Research Proceedings 2013

Author

Listed:
  • Frank Gurski

    (Heinrich Heine University)

  • Jochen Rethmann

    (Niederrhein University of Applied Sciences)

  • Egon Wanke

    (Heinrich Heine University)

Abstract

We study the combinatorial FIFO stack-up problem. In delivery industry, bins have to be stacked-up from conveyor belts onto pallets. Given $$k$$ k sequences $$q_1, \ldots , q_k$$ q 1 , … , q k of labeled bins and a positive integer $$p$$ p , the goal is to stack-up the bins by iteratively removing the first bin of one of the $$k$$ k sequences and put it onto a pallet located at one of $$p$$ p stack-up places. Each of these pallets has to contain bins of only one label, bins of different labels have to be placed on different pallets. After all bins of one label have been removed from the given sequences, the corresponding place becomes available for a pallet of bins of another label. The FIFO stack-up problem is NP-complete in general. In this paper we show that the problem can be solved in polynomial time, if the number $$k$$ k of given sequences is fixed.

Suggested Citation

  • Frank Gurski & Jochen Rethmann & Egon Wanke, 2014. "Moving Bins from Conveyor Belts onto Pallets Using FIFO Queues," Operations Research Proceedings, in: Dennis Huisman & Ilse Louwerse & Albert P.M. Wagelmans (ed.), Operations Research Proceedings 2013, edition 127, pages 185-191, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-07001-8_25
    DOI: 10.1007/978-3-319-07001-8_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.

    Citations

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


    Cited by:

    1. Frank Gurski & Jochen Rethmann & Egon Wanke, 2016. "On the complexity of the FIFO stack-up problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 83(1), pages 33-52, February.
    2. Frank Gurski & Jochen Rethmann & Egon Wanke, 2016. "On the complexity of the FIFO stack-up problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 83(1), pages 33-52, February.

    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-319-07001-8_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.