Scholarlink

Abstract <p> A warehouse goods placement problem is considered, where the aim is to minimize thetotal time of fulfillment of orders from a given list. NP-hardness of this problem even inthe simplest special case is proved. An ILP model is suggested for this problem. Two heuristicalgorithms are developed for solving this problem; their effectiveness is analyzed using randomlygenerated instances.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On One Optimization Problem for Warehouse Goods Placement

  • 期刊论文

  • 发表日期：

    2025年11月2日

查看全文
  • K. O. Motorin,
  • A. V. Pyatkin

摘要

Abstract

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