Optimizing blocking and starving delays in sequential zone order picking systems through time-decomposed workload balancing

IF 4.3 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2025-08-01 Epub Date: 2025-03-23 DOI:10.1016/j.cor.2025.107060
Jeongwon Park , Soondo Hong
{"title":"Optimizing blocking and starving delays in sequential zone order picking systems through time-decomposed workload balancing","authors":"Jeongwon Park ,&nbsp;Soondo Hong","doi":"10.1016/j.cor.2025.107060","DOIUrl":null,"url":null,"abstract":"<div><div>Sequential zone order picking systems frequently encounter blocking delays when a tote cannot proceed to the next zone because it is occupied, and starving delays when a tote remains unassigned to a zone. General approaches to minimize delays include balancing the total workload across zones, grouping the orders into batches, or optimizing the order release sequences. However, the issue of temporal workload imbalances caused by instantaneous differences in processing time between zones has not been addressed. Since temporal workload imbalances result in delays, this study proposes the decomposition of workloads into time slots and develops a temporal workload balancing model (TBM) that incorporates batching and sequencing based on time slot decomposition. We also develop an adaptive large neighborhood search (ALNS) heuristic model to tackle large-scale practical problems of temporal workload imbalance. In simulation experiments, we compare the TBM model to alternative batching strategies in an order picking environment featuring consecutive batch windows. Our findings reveal that the TBM model yields an average reduction in makespan of 27.65% and 15.99% compared to random strategy and baseline method. We conclude that temporal workload balancing can minimize blocking and starving delays and maximize order picking productivity.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"180 ","pages":"Article 107060"},"PeriodicalIF":4.3000,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825000887","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/3/23 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Sequential zone order picking systems frequently encounter blocking delays when a tote cannot proceed to the next zone because it is occupied, and starving delays when a tote remains unassigned to a zone. General approaches to minimize delays include balancing the total workload across zones, grouping the orders into batches, or optimizing the order release sequences. However, the issue of temporal workload imbalances caused by instantaneous differences in processing time between zones has not been addressed. Since temporal workload imbalances result in delays, this study proposes the decomposition of workloads into time slots and develops a temporal workload balancing model (TBM) that incorporates batching and sequencing based on time slot decomposition. We also develop an adaptive large neighborhood search (ALNS) heuristic model to tackle large-scale practical problems of temporal workload imbalance. In simulation experiments, we compare the TBM model to alternative batching strategies in an order picking environment featuring consecutive batch windows. Our findings reveal that the TBM model yields an average reduction in makespan of 27.65% and 15.99% compared to random strategy and baseline method. We conclude that temporal workload balancing can minimize blocking and starving delays and maximize order picking productivity.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过时间分解的工作负载平衡优化顺序区域拣货系统中的阻塞和饥饿延迟
顺序区域排序系统经常遇到阻塞延迟,当一个手提袋由于被占用而无法进入下一个区域时,以及当一个手提袋仍然未分配到一个区域时,会遇到饥饿延迟。最小化延迟的一般方法包括跨区域平衡总工作负载,将订单分组成批,或优化订单发布序列。但是,由区域之间处理时间的瞬时差异引起的暂时工作负载不平衡问题尚未得到解决。由于时间工作负载不平衡会导致延迟,本研究提出将工作负载分解为时隙,并基于时隙分解开发了一种结合批处理和排序的时间工作负载平衡模型(TBM)。我们还开发了一种自适应大邻域搜索(ALNS)启发式模型来解决时间负载不平衡的大规模实际问题。在仿真实验中,我们将TBM模型与具有连续批窗口的订单挑选环境中的替代批处理策略进行了比较。研究结果表明,与随机策略和基线方法相比,TBM模型的完工时间平均减少了27.65%和15.99%。我们得出结论,时间工作负载平衡可以最大限度地减少阻塞和饥饿延迟,并最大限度地提高订单挑选效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
Beware of the classical benchmark instances for the Traveling Salesman Problem with Time Windows A speed-up for Helsgaun’s TSP heuristic by relaxing the positive gain criterion A memory-enhanced Greedy Randomized Adaptive Search Procedure for the Multi-Pickup and Delivery Problem with Time Windows A neural-driven constructive heuristic for the flexible job shop scheduling problem: An efficient alternative to complex deep learning methods Constraint programming approaches for stochastic Resource-Constrained Project Scheduling Problem subject to disruptions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1