A Practical Approach for the FIFO Stack-Up Problem

Gurski, Frank; Rethmann, Jochen; Wanke, Egon

doi:10.1007/978-3-319-18167-7_13

Cited by 6 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is a problem originated from logistics when there is a need to stack up bins from a set of conveyor belts onto pallets. Given is a list Q = (q 1 , ..., q k ) of sequences of various types of products and a positive integer p. An objective is to decide whether there is a processing of Q, such that in each processing configuration of Q, at most p pallets are partially filled with products assuming that each pallet is dedicated to a single product type only [7]. The problem was submitted by researchers inspired by the Brilliant Challenges contest.…”

Section: Fifo Stack-up Problemmentioning

confidence: 99%

Brilliant Challenges Optimization Problem Submission Contest Final Report

Badura,

Laskowski,

Antczak

et al. 2021

Preprint

View full text Add to dashboard Cite

This paper concludes the Brilliant Challenges contest. Participants had to design interesting optimization problems and publish them using the Optil.io platform. It was the first widely-advertised contest in the area of operational research where the objective was to submit the problem definition instead of the algorithmic solutions. Thus, it is a crucial contribution to Open Science and the application of crowdsourcing methodology to solve discrete optimization problems. The paper briefly describes submitted problems, presents the winners, and discusses the contest's achievements and shortcomings. Finally, we define guidelines supporting the organization of contests of similar type in the future.

show abstract

Section: Fifo Stack-up Problemmentioning

confidence: 99%

Brilliant Challenges Optimization Problem Submission Contest Final Report

Badura,

Laskowski,

Antczak

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…A topological ordering of the vertices of digraph G can be found by a depth first search algorithm in The running time is not better but it shows immediately that it can be done in polynomial time. Independently we introduced a breadth first search solution for the FIFO stack-up problem in [6]. denote the remaining bins of sequence q after removing the first i bins.…”

Section: The Processing Graphmentioning

confidence: 99%

“…The running time is not better but it shows immediately that it can be done in polynomial time. Independently we introduced a breadth first search solution for the FIFO stack-up problem in [6].…”

Section: The Processing Graphmentioning

confidence: 99%

On the complexity of the FIFO stack-up problem

2015

Self Cite

View full text Add to dashboard Cite

We study the combinatorial FIFO stack-up problem. In delivery industry, bins have to be stacked-up from conveyor belts onto pallets with respect to customer orders. Given k sequences q1, . . . , q k of labeled bins and a positive integer p, the aim is to stack-up the bins by iteratively removing the first bin of one of the k sequences and put it onto an initially empty pallet of unbounded capacity located at one of p stack-up places. Bins with different pallet labels have to be placed on different pallets, bins with the same pallet label have to be placed on the same pallet. After all bins for a pallet have been removed from the given sequences, the corresponding stack-up place will be cleared and becomes available for a further pallet. The FIFO stack-up problem is to find a stack-up sequence such that all pallets can be build-up with the available p stack-up places.In this paper, we introduce two digraph models for the FIFO stack-up problem, namely the processing graph and the sequence graph. We 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 connection implies that the FIFO stack-up problem is NP-complete in general, even if there are at most 6 bins for every pallet and that the problem can be solved in polynomial time, if the number p of stack-up places is assumed to be fixed. Further the processing graph allows us to show that the problem can be solved in polynomial time, if the number k of sequences is assumed to be fixed.

show abstract