发布求助
文献互助 智能选刊 最新文献

Journal of Scheduling最新文献

筛选
英文 中文
A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence 注意:最大化给定作业序列的实时作业的加权数
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-01-25 DOI: 10.1007/s10951-022-00772-4
Enrique Gerstl, G. Mosheiov
{"title":"A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence","authors":"Enrique Gerstl, G. Mosheiov","doi":"10.1007/s10951-022-00772-4","DOIUrl":"https://doi.org/10.1007/s10951-022-00772-4","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2023-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48809770","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A quest for a fair schedule: The International Young Physicists' Tournament. 对公平时间表的追求:国际青年物理学家锦标赛。
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-01-01 DOI: 10.1007/s10951-022-00752-8
Katarína Cechlárová, Ágnes Cseh, Zsuzsanna Jankó, Marián Kireš, Lukáš Miňo
{"title":"A quest for a fair schedule: The International Young Physicists' Tournament.","authors":"Katarína Cechlárová,&nbsp;Ágnes Cseh,&nbsp;Zsuzsanna Jankó,&nbsp;Marián Kireš,&nbsp;Lukáš Miňo","doi":"10.1007/s10951-022-00752-8","DOIUrl":"https://doi.org/10.1007/s10951-022-00752-8","url":null,"abstract":"<p><p>The International Young Physicists' Tournament is an established team-oriented scientific competition between high school students from 37 countries on 5 continents. The competition consists of scientific discussions called Fights. Three or four teams participate in each Fight, while rotating the roles of Presenter, Opponent, Reviewer, and Observer among them. The rules of a few countries require that each team announces in advance three problems they will present at the regional tournament. The task of the organizers is to choose the composition of Fights in such a way that each team presents each of its chosen problems exactly once and within a single Fight no problem is presented more than once. Besides formalizing these feasibility conditions, in this paper we formulate several additional fairness criteria for tournament schedules. We show that the fulfillment of some of them can be ensured by constructing suitable edge colorings in bipartite graphs. To find fair schedules, we propose integer linear programs and test them on real as well as randomly generated data.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9514718/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10776579","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Single machine scheduling with step-learning 基于分步学习的单机调度
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-12-17 DOI: 10.1007/s10951-022-00763-5
Matan Atsmony, Baruch Mor, G. Mosheiov
{"title":"Single machine scheduling with step-learning","authors":"Matan Atsmony, Baruch Mor, G. Mosheiov","doi":"10.1007/s10951-022-00763-5","DOIUrl":"https://doi.org/10.1007/s10951-022-00763-5","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49297345","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Minimizing the expected waiting time of emergency jobs 减少紧急工作的预期等待时间
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-12-12 DOI: 10.1007/s10951-022-00767-1
Arne Schulz, Malte Fliedner
{"title":"Minimizing the expected waiting time of emergency jobs","authors":"Arne Schulz, Malte Fliedner","doi":"10.1007/s10951-022-00767-1","DOIUrl":"https://doi.org/10.1007/s10951-022-00767-1","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52494627","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times 具有阶跃恶化处理时间的比例流水车间调度的精确算法和近似方案
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-11-22 DOI: 10.1007/s10951-022-00766-2
D. Shabtay, Baruch Mor
{"title":"Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times","authors":"D. Shabtay, Baruch Mor","doi":"10.1007/s10951-022-00766-2","DOIUrl":"https://doi.org/10.1007/s10951-022-00766-2","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42704200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Collaborative optimization of workshop layout and scheduling 车间布置和调度协同优化
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-11-17 DOI: 10.1007/s10951-022-00761-7
Yaliang Wang, Xinyu Fan, Chendi Ni, Kanghong Gao, Shousong Jin
{"title":"Collaborative optimization of workshop layout and scheduling","authors":"Yaliang Wang, Xinyu Fan, Chendi Ni, Kanghong Gao, Shousong Jin","doi":"10.1007/s10951-022-00761-7","DOIUrl":"https://doi.org/10.1007/s10951-022-00761-7","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42542609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring 如何在驾驶时充电:在架空线路下安排电动汽车的点对点交付
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-11-07 DOI: 10.1007/s10951-022-00758-2
N. Boysen, Dirk Briskorn, Stefan Schwerdfeger
{"title":"How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring","authors":"N. Boysen, Dirk Briskorn, Stefan Schwerdfeger","doi":"10.1007/s10951-022-00758-2","DOIUrl":"https://doi.org/10.1007/s10951-022-00758-2","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46938908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Special Issue on papers from the 2019 Workshop on Models and Algorithms for Planning and Scheduling Problems 2019规划与调度问题模型与算法研讨会论文特刊
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-11-07 DOI: 10.1007/s10951-022-00765-3
S. Khuller
{"title":"Special Issue on papers from the 2019 Workshop on Models and Algorithms for Planning and Scheduling Problems","authors":"S. Khuller","doi":"10.1007/s10951-022-00765-3","DOIUrl":"https://doi.org/10.1007/s10951-022-00765-3","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47160147","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An improved approximation algorithm for a scheduling problem with transporter coordination 运输车协调调度问题的一种改进近似算法
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-11-02 DOI: 10.1007/s10951-022-00762-6
Yinling Wang, Xin Han, Yong Zhang, J. Błażewicz
{"title":"An improved approximation algorithm for a scheduling problem with transporter coordination","authors":"Yinling Wang, Xin Han, Yong Zhang, J. Błażewicz","doi":"10.1007/s10951-022-00762-6","DOIUrl":"https://doi.org/10.1007/s10951-022-00762-6","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45386097","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Graph representation of the fixed route dial-a-ride problem 固定路线拨号乘车问题的图形表示
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-10-25 DOI: 10.1007/s10951-022-00757-3
Tal Grinshpoun, E. Shufan, H. Ilani, V. Levit, H. Brama
{"title":"Graph representation of the fixed route dial-a-ride problem","authors":"Tal Grinshpoun, E. Shufan, H. Ilani, V. Levit, H. Brama","doi":"10.1007/s10951-022-00757-3","DOIUrl":"https://doi.org/10.1007/s10951-022-00757-3","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46648599","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信