The warehouse scheduling problem: formulation and algorithms
Titel:
The warehouse scheduling problem: formulation and algorithms
Auteur:
Hariga, Moncer A. Jackson, Peter L.
Verschenen in:
IIE transactions
Paginering:
Jaargang 28 (1996) nr. 2 pagina's 115-127
Jaar:
1996-02-01
Inhoud:
The Warehouse Scheduling Problem is a deterministic multi-item inventory problem with a restriction on warehouse floor space available. We formulate a mixed integer nonlinear programming problem for the objective of minimizing long run inventory holding and order costs per unit of time. We integrate algorithms for staggering orders, described in companion papers, with a heuristic to choose the order sequences. The result is called Sequenced Staggering. We describe a new algorithm to generate order frequencies, called the powers-of-two-factor-of-three technique, as a generalization of Roundy's roundoff technique for powers-of-two policies. We report on a computational study of four hybrid algorithms for solving the warehouse scheduling problem, including the competing algorithm of Gallego, Queyranne, and Simchi-Levi. Based on these results, we recommend the combination of powers-of-two frequencies with Sequenced Staggering.
Tijdschrift beschrijving