IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v51y2000i2p203-233.html
   My bibliography  Save this article

An approximation algorithm for the stack-up problem

Author

Listed:
  • Jochen Rethmann
  • Egon Wanke

Abstract

We consider the combinatorial stack-up problem motivated by stacking up bins from a conveyor onto pallets. The stack-up problem is to decide whether a given list q of labeled objects can be processed by removing step by step one of the first s objects of q so that the following holds. After each removal there are at most p labels for which the first object is already removed from q and the last object is still contained in q. We give some NP-completeness results and we introduce and analyze a polynomial time approximation algorithm for the stack-up problem. Copyright Springer-Verlag Berlin Heidelberg 2000

Suggested Citation

  • Jochen Rethmann & Egon Wanke, 2000. "An approximation algorithm for the stack-up problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 51(2), pages 203-233, April.
    • Handle: RePEc:spr:mathme:v:51:y:2000:i:2:p:203-233
    DOI: 10.1007/s001860050085
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860050085
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860050085?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. Frank Gurski & Carolin Rehs & Jochen Rethmann & Egon Wanke, 2019. "Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 581-611, June.
    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.
    3. 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:mathme:v:51:y:2000:i:2:p:203-233. 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.