Algorithms for Controlling Palletizers

Frank Gurski (), Jochen Rethmann () and Egon Wanke ()
Additional contact information
Frank Gurski: University of Düsseldorf
Jochen Rethmann: Niederrhein University of Applied Sciences
Egon Wanke: University of Düsseldorf

A chapter in Operations Research Proceedings 2014, 2016, pp 197-203 from Springer

Abstract: Abstract Palletizers are widely used in delivery industry. We consider a large palletizer where each stacker crane grabs a bin from one of k conveyors and position it onto a pallet located at one of p stack-up places. All bins have the same size. Each pallet is destined for one customer. A completely stacked pallet will be removed automatically and a new empty pallet is placed at the palletizer. The FIFO Stack-Up problem is to decide whether the bins can be palletized by using at most p stack-up places. We introduce a digraph and a linear programming model for the problem. Since the FIFO Stack-Up problem is computational intractable and is defined on inputs of various informations, we study the parameterized complexity. Based on our models we give xp-algorithms and fpt-algorithms for various parameters, and approximation results for the problem.

Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-28697-6_28

Ordering information: This item can be ordered from
http://www.springer.com/9783319286976

DOI: 10.1007/978-3-319-28697-6_28

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().