Online order acceptance and scheduling in a single machine environment

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2025-03-05 DOI:10.1016/j.cor.2025.107028
Chunyan Zheng, Jin Yu, Guohua Wan
{"title":"Online order acceptance and scheduling in a single machine environment","authors":"Chunyan Zheng,&nbsp;Jin Yu,&nbsp;Guohua Wan","doi":"10.1016/j.cor.2025.107028","DOIUrl":null,"url":null,"abstract":"<div><div>We consider the online order acceptance and scheduling (OAS) problem, a widely studied problem in its offline counterpart, where orders arrive online sequentially with associated rewards, arrival times, and due dates in a finite planning horizon. The objective is to make real-time order acceptance and scheduling decisions so as to maximize the total profit. To tackle this problem, we derive an upper bound on the competitive ratio of any online algorithm for the online OAS problem and introduce three algorithms (online greedy, online learning, and delay). For the online greedy algorithm, we provide a performance guarantee under the mild conditions via theoretical analysis. Furthermore, through computational studies we highlight that both the urgency of due dates of the orders and the workload level of the system can significantly influence the performance of the online algorithms. Since each proposed algorithm has its advantages and disadvantages, we categorize different scenarios for using the suitable algorithm, aiming at offering managerial insights for firms to make informed decisions.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"179 ","pages":"Article 107028"},"PeriodicalIF":4.1000,"publicationDate":"2025-03-05","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/S0305054825000565","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

We consider the online order acceptance and scheduling (OAS) problem, a widely studied problem in its offline counterpart, where orders arrive online sequentially with associated rewards, arrival times, and due dates in a finite planning horizon. The objective is to make real-time order acceptance and scheduling decisions so as to maximize the total profit. To tackle this problem, we derive an upper bound on the competitive ratio of any online algorithm for the online OAS problem and introduce three algorithms (online greedy, online learning, and delay). For the online greedy algorithm, we provide a performance guarantee under the mild conditions via theoretical analysis. Furthermore, through computational studies we highlight that both the urgency of due dates of the orders and the workload level of the system can significantly influence the performance of the online algorithms. Since each proposed algorithm has its advantages and disadvantages, we categorize different scenarios for using the suitable algorithm, aiming at offering managerial insights for firms to make informed decisions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约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.
期刊最新文献
Ship emission monitoring with a joint mode of motherships and unmanned aerial vehicles Logic-based Benders decomposition methods for the distributed permutation flow shop scheduling problem with production and transportation cost Scheduling moldable tasks on homogeneous multi-cluster platforms with GPUs Online order acceptance and scheduling in a single machine environment Multi-armed bandit for the cyclic minimum sitting arrangement problem
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1