可变前瞻间隔不兼容作业族的在线批调度

Wenhua Li, Libo Wang, Hang Yuan
{"title":"可变前瞻间隔不兼容作业族的在线批调度","authors":"Wenhua Li, Libo Wang, Hang Yuan","doi":"10.1142/s0217595922400127","DOIUrl":null,"url":null,"abstract":"We consider online parallel-batch scheduling of [Formula: see text] incompatible unit-length job families with variable lookahead interval to minimize the maximum completion time, where [Formula: see text] is the number of job families which is known in advance. Incompatible job family means that a batch only contains the jobs from the same job family. At any time [Formula: see text], an online algorithm can foresee the information of the jobs arriving in the time interval [Formula: see text], where [Formula: see text] is variable. When the batch capacity [Formula: see text] and [Formula: see text], we provide a best possible online algorithm with competitive ratio [Formula: see text] for [Formula: see text] and [Formula: see text], where [Formula: see text] is a positive root of [Formula: see text]. When the batch capacity [Formula: see text] and [Formula: see text], we give an online algorithm with competitive ratio [Formula: see text] for [Formula: see text] and [Formula: see text], and prove that it is the best possible for [Formula: see text] and [Formula: see text].","PeriodicalId":8478,"journal":{"name":"Asia Pac. J. Oper. Res.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval\",\"authors\":\"Wenhua Li, Libo Wang, Hang Yuan\",\"doi\":\"10.1142/s0217595922400127\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider online parallel-batch scheduling of [Formula: see text] incompatible unit-length job families with variable lookahead interval to minimize the maximum completion time, where [Formula: see text] is the number of job families which is known in advance. Incompatible job family means that a batch only contains the jobs from the same job family. At any time [Formula: see text], an online algorithm can foresee the information of the jobs arriving in the time interval [Formula: see text], where [Formula: see text] is variable. When the batch capacity [Formula: see text] and [Formula: see text], we provide a best possible online algorithm with competitive ratio [Formula: see text] for [Formula: see text] and [Formula: see text], where [Formula: see text] is a positive root of [Formula: see text]. When the batch capacity [Formula: see text] and [Formula: see text], we give an online algorithm with competitive ratio [Formula: see text] for [Formula: see text] and [Formula: see text], and prove that it is the best possible for [Formula: see text] and [Formula: see text].\",\"PeriodicalId\":8478,\"journal\":{\"name\":\"Asia Pac. J. Oper. Res.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Asia Pac. J. Oper. Res.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0217595922400127\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Asia Pac. J. Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0217595922400127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

考虑[公式:见文]不兼容的单位长度作业族具有可变超前间隔的在线并行批调度,以最小化最大完成时间,其中[公式:见文]为事先已知的作业族数量。不兼容的作业族意味着一个批处理只包含来自相同作业族的作业。在任何时刻[公式:见文],在线算法都可以预测在[公式:见文]时间间隔内到达的作业信息,其中[公式:见文]是可变的。当批量容量[公式:见文]和[公式:见文]时,我们为[公式:见文]和[公式:见文]提供了一个具有竞争比[公式:见文]的最佳在线算法,其中[公式:见文]是[公式:见文]的正根。当批量容量[公式:见文]和[公式:见文]时,给出了[公式:见文]和[公式:见文]具有竞争比[公式:见文]的在线算法,并证明了它是[公式:见文]和[公式:见文]的最佳算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval
We consider online parallel-batch scheduling of [Formula: see text] incompatible unit-length job families with variable lookahead interval to minimize the maximum completion time, where [Formula: see text] is the number of job families which is known in advance. Incompatible job family means that a batch only contains the jobs from the same job family. At any time [Formula: see text], an online algorithm can foresee the information of the jobs arriving in the time interval [Formula: see text], where [Formula: see text] is variable. When the batch capacity [Formula: see text] and [Formula: see text], we provide a best possible online algorithm with competitive ratio [Formula: see text] for [Formula: see text] and [Formula: see text], where [Formula: see text] is a positive root of [Formula: see text]. When the batch capacity [Formula: see text] and [Formula: see text], we give an online algorithm with competitive ratio [Formula: see text] for [Formula: see text] and [Formula: see text], and prove that it is the best possible for [Formula: see text] and [Formula: see text].
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信