IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v128y2001i1p74-97.html
   My bibliography  Save this article

Stack-up algorithms for palletizing at delivery industry

Author

Listed:
  • Rethmann, J.
  • Wanke, E.

Abstract

No abstract is available for this item.

Suggested Citation

  • Rethmann, J. & Wanke, E., 2001. "Stack-up algorithms for palletizing at delivery industry," European Journal of Operational Research, Elsevier, vol. 128(1), pages 74-97, January.
    • Handle: RePEc:eee:ejores:v:128:y:2001:i:1:p:74-97
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00351-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. de Koster, Rene, 1994. "Performance approximation of pick-to-belt orderpicking systems," European Journal of Operational Research, Elsevier, vol. 72(3), pages 558-573, February.
    2. Rethmann, J. & Wanke, E., 1997. "Storage controlled pile-up systems, theoretical foundations," European Journal of Operational Research, Elsevier, vol. 103(3), pages 515-530, December.
    3. Arthur Warburton, 1987. "Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems," Operations Research, INFORMS, vol. 35(1), pages 70-79, February.
    Full references (including those not matched with items on IDEAS)

    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. Stein, William E. & Seale, Darryl A. & Rapoport, Amnon, 2003. "Analysis of heuristic solutions to the best choice problem," European Journal of Operational Research, Elsevier, vol. 151(1), pages 140-152, November.
    4. 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.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    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. Espelage, W. & Wanke, E., 2005. "A linear time approximation algorithm for movement minimization in conveyor flow shop processing," European Journal of Operational Research, Elsevier, vol. 160(2), pages 485-500, January.
    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.
    4. Grzegorz Tarczyński, 2023. "Linear programming models for optimal workload and batching in pick-and-pass warehousing systems," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 33(3), pages 141-158.
    5. Jamain, Florian, 2014. "Représentations discrètes de l'ensemble des points non dominés pour des problèmes d'optimisation multi-objectifs," Economics Thesis from University Paris Dauphine, Paris Dauphine University, number 123456789/14002 edited by Bazgan, Cristina.
    6. Murthy, Ishwar & Sarkar, Sumit, 1997. "Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function," European Journal of Operational Research, Elsevier, vol. 103(1), pages 209-229, November.
    7. Pan, Jason Chao-Hsien & Shih, Po-Hsun & Wu, Ming-Hung, 2015. "Order batching in a pick-and-pass warehousing system with group genetic algorithm," Omega, Elsevier, vol. 57(PB), pages 238-248.
    8. Randeep Bhatia & Sudipto Guha & Samir Khuller & Yoram J. Sussmann, 1998. "Facility Location with Dynamic Distance Functions," Journal of Combinatorial Optimization, Springer, vol. 2(3), pages 199-217, September.
    9. Yu, M. & de Koster, M.B.M., 2007. "Performance Approximation and Design of Pick-and-Pass Order Picking Systems," ERIM Report Series Research in Management ERS-2007-082-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    10. 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.
    11. Xie, Chi & Travis Waller, S., 2012. "Parametric search and problem decomposition for approximating Pareto-optimal paths," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1043-1067.
    12. Matthias Müller-Hannemann & Karsten Weihe, 2006. "On the cardinality of the Pareto set in bicriteria shortest path problems," Annals of Operations Research, Springer, vol. 147(1), pages 269-286, October.
    13. Christian Roed Pedersen & Lars Relund Nielsen & Kim Allan Andersen, 2008. "The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 400-411, August.
    14. Kameng Nip & Zhenbo Wang & Fabrice Talla Nobibon & Roel Leus, 2015. "A combination of flow shop scheduling and the shortest path problem," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 36-52, January.
    15. Soroush, H.M., 2008. "Optimal paths in bi-attribute networks with fractional cost functions," European Journal of Operational Research, Elsevier, vol. 190(3), pages 633-658, November.
    16. de Koster, Rene & Le-Duc, Tho & Roodbergen, Kees Jan, 2007. "Design and control of warehouse order picking: A literature review," European Journal of Operational Research, Elsevier, vol. 182(2), pages 481-501, October.
    17. Luigi Di Puglia Pugliese & Francesca Guerriero, 2013. "A Reference Point Approach for the Resource Constrained Shortest Path Problems," Transportation Science, INFORMS, vol. 47(2), pages 247-265, May.
    18. Daniel Vanderpooten & Lakmali Weerasena & Margaret M. Wiecek, 2017. "Covers and approximations in multiobjective optimization," Journal of Global Optimization, Springer, vol. 67(3), pages 601-619, March.
    19. Bazgan, Cristina & Hugot, Hadrien & Vanderpooten, Daniel, 2009. "Implementing an efficient fptas for the 0-1 multi-objective knapsack problem," European Journal of Operational Research, Elsevier, vol. 198(1), pages 47-56, October.
    20. Jianping Li & Weidong Li & Junran Lichen, 2014. "The subdivision-constrained routing requests problem," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 152-163, January.

    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:eee:ejores:v:128:y:2001:i:1:p:74-97. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.