从单拣货到多工作站的拣货调度

IF 1.8 4区 管理学 Q3 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Jinchang Hu, Xin Wang
{"title":"从单拣货到多工作站的拣货调度","authors":"Jinchang Hu, Xin Wang","doi":"10.1051/ro/2023156","DOIUrl":null,"url":null,"abstract":"To reduce human resource costs, the part-to-picker order fulfilment systems may have a single picker in charge of multiple workstations. And the picking speed of the picker becomes faster as the picking number increases due to the learning effect in the picking operation. In this paper, the scheduling problem to optimizing picking sequence of the picker is presented to minimize the maximum picking time, where one picker is responsible for multiple workstations. The learning effect and travel time between workstations are taken into account to improve scheduling accuracy. Two mixed integer programming (MIP) models are proposed to solve the problem, namely the rank-based model and disjunctive model. The performance of the two Mixed Integer Programming (MIP) models has been evaluated, and it has been found that they are only capable of solving small-scale problems. The rank-based model is limited to solving problems with up to 9 groups, whereas the disjunctive model can handle up to 20 groups. Therefore, the disjunctive model outperforms the rank-based model. Moreover, this paper proposes Interval Insertion NEH (IINEH) and iterative greedy (IG) algorithm to solve the large-scale problem. Numerical experiments demonstrate the effectiveness of the two methods to solve the problem, where IINEH operates faster while IG gives better results. Therefore, when faced with a large-scale problem, IINEH is recommended if a quick solution is needed. If better optimization results are needed, the decision maker can choose IG.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"31 1","pages":"0"},"PeriodicalIF":1.8000,"publicationDate":"2023-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Picking scheduling for single picker to multi-workstations of the part-to-picker order fulfilment system\",\"authors\":\"Jinchang Hu, Xin Wang\",\"doi\":\"10.1051/ro/2023156\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To reduce human resource costs, the part-to-picker order fulfilment systems may have a single picker in charge of multiple workstations. And the picking speed of the picker becomes faster as the picking number increases due to the learning effect in the picking operation. In this paper, the scheduling problem to optimizing picking sequence of the picker is presented to minimize the maximum picking time, where one picker is responsible for multiple workstations. The learning effect and travel time between workstations are taken into account to improve scheduling accuracy. Two mixed integer programming (MIP) models are proposed to solve the problem, namely the rank-based model and disjunctive model. The performance of the two Mixed Integer Programming (MIP) models has been evaluated, and it has been found that they are only capable of solving small-scale problems. The rank-based model is limited to solving problems with up to 9 groups, whereas the disjunctive model can handle up to 20 groups. Therefore, the disjunctive model outperforms the rank-based model. Moreover, this paper proposes Interval Insertion NEH (IINEH) and iterative greedy (IG) algorithm to solve the large-scale problem. Numerical experiments demonstrate the effectiveness of the two methods to solve the problem, where IINEH operates faster while IG gives better results. Therefore, when faced with a large-scale problem, IINEH is recommended if a quick solution is needed. If better optimization results are needed, the decision maker can choose IG.\",\"PeriodicalId\":54509,\"journal\":{\"name\":\"Rairo-Operations Research\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2023-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Rairo-Operations Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1051/ro/2023156\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Rairo-Operations Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1051/ro/2023156","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

摘要

为了减少人力资源成本,从零件到拾取者的订单履行系统可以由一个拾取者负责多个工作站。由于采摘操作中的学习效应,采摘器的采摘速度随着采摘次数的增加而变快。本文研究了一个采集机负责多个工位,以最大采集机时间为目标,优化采集机采集机顺序的调度问题。考虑了学习效应和工作站之间的行程时间,提高了调度精度。为了解决这一问题,提出了两种混合整数规划模型,即基于秩的模型和析取模型。对这两种混合整数规划(MIP)模型的性能进行了评价,发现它们只能解决小规模问题。基于等级的模型最多只能解决9个组的问题,而析取模型最多可以处理20个组。因此,析取模型优于基于秩的模型。此外,本文还提出了区间插入NEH (IINEH)和迭代贪婪(IG)算法来解决大规模问题。数值实验证明了两种方法的有效性,其中IINEH的运算速度更快,而IG的运算结果更好。因此,当面临大规模问题时,如果需要快速解决,建议使用IINEH。如果需要更好的优化结果,决策者可以选择IG。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Picking scheduling for single picker to multi-workstations of the part-to-picker order fulfilment system
To reduce human resource costs, the part-to-picker order fulfilment systems may have a single picker in charge of multiple workstations. And the picking speed of the picker becomes faster as the picking number increases due to the learning effect in the picking operation. In this paper, the scheduling problem to optimizing picking sequence of the picker is presented to minimize the maximum picking time, where one picker is responsible for multiple workstations. The learning effect and travel time between workstations are taken into account to improve scheduling accuracy. Two mixed integer programming (MIP) models are proposed to solve the problem, namely the rank-based model and disjunctive model. The performance of the two Mixed Integer Programming (MIP) models has been evaluated, and it has been found that they are only capable of solving small-scale problems. The rank-based model is limited to solving problems with up to 9 groups, whereas the disjunctive model can handle up to 20 groups. Therefore, the disjunctive model outperforms the rank-based model. Moreover, this paper proposes Interval Insertion NEH (IINEH) and iterative greedy (IG) algorithm to solve the large-scale problem. Numerical experiments demonstrate the effectiveness of the two methods to solve the problem, where IINEH operates faster while IG gives better results. Therefore, when faced with a large-scale problem, IINEH is recommended if a quick solution is needed. If better optimization results are needed, the decision maker can choose IG.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Rairo-Operations Research
Rairo-Operations Research 管理科学-运筹学与管理科学
CiteScore
3.60
自引率
22.20%
发文量
206
审稿时长
>12 weeks
期刊介绍: RAIRO-Operations Research is an international journal devoted to high-level pure and applied research on all aspects of operations research. All papers published in RAIRO-Operations Research are critically refereed according to international standards. Any paper will either be accepted (possibly with minor revisions) either submitted to another evaluation (after a major revision) or rejected. Every effort will be made by the Editorial Board to ensure a first answer concerning a submitted paper within three months, and a final decision in a period of time not exceeding six months.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信