Skip to main content
SpringerLink
Log in

Directed Pathwidth and Palletizers

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9486))

  • 1040 Accesses

Abstract

In delivery industry, bins have to be stacked-up from conveyor belts onto pallets. Given k sequences of labeled bins and a positive integer p. The goal is to stack-up the bins by iteratively removing the first bin of one of the k sequences and put it onto a pallet located at one of 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. In this paper we introduce a graph model for this problem, the so called sequence graph, which allows us to show that there is a processing of some list of sequences with at most p stack-up places if and only if the sequence graph of this list has directed pathwidth at most \(p-1\).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11, 1–23 (1993)

    MathSciNet  MATH  Google Scholar 

  2. Borodin, A.: On-line Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  3. de Koster, R.: Performance approximation of pick-to-belt orderpicking systems. Eur. J. Oper. Res. 92, 558–573 (1994)

    Article  MATH  Google Scholar 

  4. Dehmer, M., Emmert-Streib, F. (eds.): Quantitative Graph Theory: Mathematical Foundations and Applications. CRC Press Inc., New York (2014)

    MATH  Google Scholar 

  5. Fiat, A., Woeginger, G.J. (eds.): Online Algorithms: The State of the Art. LNCS, vol. 1442. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  6. Gurski, F., Rethmann, J., Wanke, E.: Moving bins from conveyor belts onto pallets using FIFO queues. In: Huisman, D., Louwerse, I. (eds.) Operations Research Proceedings 2013, pp. 185–191. Springer, Heidelberg (2014)

    Google Scholar 

  7. Gurski, F., Rethmann, J., Wanke, E.: Algorithms for controlling palletizers. In: Proceedings of the International Conference on Operations Research (OR 2014), Selected Papers. Springer-Verlag (2015, to appear)

    Google Scholar 

  8. Gurski, F., Rethmann, J., Wanke, E.: A practical approach for the FIFO stack-up problem. In: An Le Thi, H., Dinh, T.P., Nguyen, N.T. (eds.) Modelling, Computation and Optimization in Information Systems and Management Sciences. AISC, vol. 360. Springer, Heidelberg (2015)

    Google Scholar 

  9. Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed tree-width. J. Comb. Theory, Ser. B 82, 138–155 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kashiwabara, T., Fujisawa, T.: NP-completeness of the problem of finding a minimum-clique-number interval graph containing a given graph as a subgraph. In: Proceedings of the International Symposium on Circuits and Systems, pp. 657–660 (1979)

    Google Scholar 

  11. Kintali, S., Kothari, N., Kumar, A.: Approximation algorithms for digraph width parameters. Theor. Comput. Sci. 562, 365–376 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kitsunai, K., Kobayashi, Y., Komuro, K., Tamaki, H., Tano, T.: Computing directed pathwidth in \(O(1.89^n)\) time. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol. 7535, pp. 182–193. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  13. Monien, B., Sudborough, I.H.: Min cut is NP-complete for edge weighted trees. Theor. Comput. Sci. 58, 209–229 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  14. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley Publishing Company, New York (1994)

    MATH  Google Scholar 

  15. Rethmann, J., Wanke, E.: Storage controlled pile-up systems, theoretical foundations. Eur. J. Oper. Res. 103(3), 515–530 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  16. Rethmann, J., Wanke, E.: On approximation algorithms for the stack-up problem. Math. Methods Oper. Res. 51, 203–233 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  17. Rethmann, J., Wanke, E.: Stack-up algorithms for palletizing at delivery industry. Eur. J. Oper. Res. 128(1), 74–97 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  18. Tamaki, H.: A polynomial time algorithm for bounded directed pathwidth. In: Kolman, P., Kratochvíl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 331–342. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Heinrich Heine University Düsseldorf, 40225, Düsseldorf, Germany

    Frank Gurski & Egon Wanke

  2. Faculty of Electrical Engineering and Computer Science, Niederrhein University of Applied Sciences, 47805, Krefeld, Germany

    Jochen Rethmann

Authors
  1. Frank Gurski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jochen Rethmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Egon Wanke
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Frank Gurski .

Editor information

Editors and Affiliations

  1. Dept. of Mathematics and Computer Science, Marywood University, Scranton, Pennsylvania, USA

    Zaixin Lu

  2. North Carolina Central University, Durham, North Carolina, USA

    Donghyun Kim

  3. University of Texas at Dallas, Richardson, Texas, USA

    Weili Wu

  4. Texas Southern University, Houston, Texas, USA

    Wei Li

  5. University of Texas at Dallas, Richardson, Texas, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Gurski, F., Rethmann, J., Wanke, E. (2015). Directed Pathwidth and Palletizers. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, DZ. (eds) Combinatorial Optimization and Applications. Lecture Notes in Computer Science(), vol 9486. Springer, Cham. https://doi.org/10.1007/978-3-319-26626-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26626-8_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26625-1

  • Online ISBN: 978-3-319-26626-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation