search query: @indexterm complexity / total: 120
reference: 78 / 120
| Author: | Rethmann, J. Wanke, E. |
| Title: | Stack-up algorithms for palletizing at delivery industry |
| Journal: | European Journal of Operational Research
2001 : JAN 1, VOL. 128:1, p. 74-97 |
| Index terms: | ALGORITHMS COMPETITION DELIVERY SERVICES INDUSTRY COMPLEXITY CONTROL |
| Language: | eng |
| Abstract: | The authors study the following multi-objective combinatorial stack-up problem from delivery industry. Given a sequence q of labeled bins and two positive integers s and p. the aim is to stack-up the bins by iteratively removing one of the first s bins of the sequence and put it to one of p stack-up places. Each of this places has to contain bins of only one label, bins of different labels have to be placed on different places. If all bins of a label are removed from q, the corresponding place becomes available for bins of another label. The authors analyze the worst-case performance of simple algorithms for the stack-up problem that are very interesting from a practical point of view. |
SCIMA