We consider the combinatorial stack-up problem motivated by stacking up bins from a conveyor onto pallets. The stack-up problem is to decide whether a given list q of labeled objects can be processed by removing step by step one of the first s objects of q so that the following holds. After each...

We consider the combinatorial stack-up problem motivated by stacking up bins from a conveyor onto pallets. The stack-up problem is to decide whether a given list q of labeled objects can be processed by removing step by step one of the first s objects of q so that the following holds. After each...

We consider the combinatorial complexity of the algorithmic design of mechanical master key locking systems. Such locking systems use pin tumblers and profile elements (wards) to realize the functional dependencies given by a key/cylinder matrix. We prove that even very restricted versions of...

We consider the movement minimization problem in a conveyer flow shop processing controlled by one worker that has to serve all machines. Each machine can only execute tasks if the worker is present. A few jobs can be queued in a buffer in front of each machine. The objective is to minimize the...

We consider the movement minimization problem in a conveyer flow shop processing controlled by one worker that has to serve all machines. Each machine can only execute tasks if the worker is present. A few jobs can be queued in a buffer in front of each machine. The objective is to minimize the...

We consider the combinatorial complexity of the algorithmic design of mechanical master key locking systems. Such locking systems use pin tumblers and profile elements (wards) to realize the functional dependencies given by a key/cylinder matrix. We prove that even very restricted versions of...