文章基本信息

标题：The Dynamic Family Assignment Heuristic
本地全文：下载
作者：Tiffany A. Bayley ; Tiffany A. Bayley ; James H. Bookbinder 等
期刊名称：IFAC PapersOnLine
印刷版ISSN：2405-8963
出版年度：2015
卷号：48
期号：3
页码：1161-1166
DOI：10.1016/j.ifacol.2015.06.241
语种：English
出版社：Elsevier
摘要：Abstract When multiple groups of orders are jointly replenished, the grouping of orders is typically performed once and remains static over the planning horizon. This, however, does not easily allow orders to be grouped by shipment due date, which is affected by updates in demand forecasts and could significantly impact container utilization. By dynamically assigning orders to containers, or “families”, products can belong to different groups in different time periods. The dynamic family assignment heuristic iterates between a bin-packing problem and a multi-family joint replenishment problem to determine the optimal order-container assignments and volume to ship in each period, while maximizing container utilization and minimizing ordering and shipment costs.
关键词：KeywordsLot-sizingjoint replenishmentshipment consolidationbin packingmixed integer programmingmetaheuristics