Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Improved Algorithms for the Evacuation Route Planning Problem Read chapter Read first chapter

2015 | OriginalPaper | Chapter

Directed Pathwidth and Palletizers

Authors : Frank Gurski, Jochen Rethmann, Egon Wanke

Published in: Combinatorial Optimization and Applications

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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\).

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Improved MaxSAT Algorithms for Instances of Degree 3
next chapter Black and White Bin Packing Revisited
Literature
1.
2.
Borodin, A.: On-line Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
3.
de Koster, R.: Performance approximation of pick-to-belt orderpicking systems. Eur. J. Oper. Res. 92, 558–573 (1994)CrossRefMATH
4.
Dehmer, M., Emmert-Streib, F. (eds.): Quantitative Graph Theory: Mathematical Foundations and Applications. CRC Press Inc., New York (2014)MATH
5.
Fiat, A., Woeginger, G.J. (eds.): Online Algorithms: The State of the Art. LNCS, vol. 1442. Springer, Heidelberg (1998)MATH
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)
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)
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)
9.
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)
11.
Kintali, S., Kothari, N., Kumar, A.: Approximation algorithms for digraph width parameters. Theor. Comput. Sci. 562, 365–376 (2015)MathSciNetCrossRefMATH
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) CrossRef
13.
14.
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley Publishing Company, New York (1994)MATH
15.
16.
17.
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) CrossRef
Metadata
Title
Directed Pathwidth and Palletizers
Authors
Frank Gurski
Jochen Rethmann
Egon Wanke
Copyright Year
2015
Book
Combinatorial Optimization and Applications

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

Electronic ISBN: 978-3-319-26626-8

Copyright Year: 2015

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

Premium Partner

    Image Credits