On One Optimization Problemfor Warehouse Goods Placement

A warehouse goods placement problem is considered, where the aim is to minimize the total time of fulfillment of orders from a given list. NP-hardness of this problem even in the simplest special case is proved. An ILP model is suggested for this problem. Two heuristic algorithms are developed for solving this problem; their effectiveness is analyzed using randomly generated instances.