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

Journal of Scheduling最新文献

筛选
英文 中文
Mathematical challenges in scheduling theory 调度理论的数学挑战
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-11-19 DOI: 10.1007/s10951-023-00797-3
Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang
{"title":"Mathematical challenges in scheduling theory","authors":"Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang","doi":"10.1007/s10951-023-00797-3","DOIUrl":"https://doi.org/10.1007/s10951-023-00797-3","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"151 6","pages":"519-521"},"PeriodicalIF":2.0,"publicationDate":"2023-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139259830","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
The price of anarchy for a berth allocation game 泊位分配博弈的无政府状态的代价
4区 工程技术
Journal of Scheduling Pub Date : 2023-11-09 DOI: 10.1007/s10951-023-00791-9
Jiayin Pan, Cong Chen, Yinfeng Xu
{"title":"The price of anarchy for a berth allocation game","authors":"Jiayin Pan, Cong Chen, Yinfeng Xu","doi":"10.1007/s10951-023-00791-9","DOIUrl":"https://doi.org/10.1007/s10951-023-00791-9","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":" 47","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135192922","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 review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing 离散制造无步进流程车间调度目标的综述与分类
4区 工程技术
Journal of Scheduling Pub Date : 2023-11-06 DOI: 10.1007/s10951-023-00795-5
Frederik Ferid Ostermeier, Jochen Deuse
{"title":"A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing","authors":"Frederik Ferid Ostermeier, Jochen Deuse","doi":"10.1007/s10951-023-00795-5","DOIUrl":"https://doi.org/10.1007/s10951-023-00795-5","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"2 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135589993","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
Improving scheduling in multi-AGV systems by task prediction 基于任务预测的多agv系统调度改进
4区 工程技术
Journal of Scheduling Pub Date : 2023-11-06 DOI: 10.1007/s10951-023-00792-8
Hongkai Fan, Dong Li, Bo Ouyang, Zhi Yan, Yaonan Wang
{"title":"Improving scheduling in multi-AGV systems by task prediction","authors":"Hongkai Fan, Dong Li, Bo Ouyang, Zhi Yan, Yaonan Wang","doi":"10.1007/s10951-023-00792-8","DOIUrl":"https://doi.org/10.1007/s10951-023-00792-8","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"33 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135589713","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
Single-machine primary–secondary scheduling with total tardiness being the primary criterion 以总延迟为主要标准的单机主从调度
4区 工程技术
Journal of Scheduling Pub Date : 2023-10-15 DOI: 10.1007/s10951-023-00793-7
Qiulan Zhao, Jinjiang Yuan
{"title":"Single-machine primary–secondary scheduling with total tardiness being the primary criterion","authors":"Qiulan Zhao, Jinjiang Yuan","doi":"10.1007/s10951-023-00793-7","DOIUrl":"https://doi.org/10.1007/s10951-023-00793-7","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136185267","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 parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment 弹性工作环境下人员调度的并行破坏与重建启发式
4区 工程技术
Journal of Scheduling Pub Date : 2023-10-15 DOI: 10.1007/s10951-023-00794-6
Rachid Hassani, Guy Desaulniers, Issmail Elhallaoui
{"title":"A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment","authors":"Rachid Hassani, Guy Desaulniers, Issmail Elhallaoui","doi":"10.1007/s10951-023-00794-6","DOIUrl":"https://doi.org/10.1007/s10951-023-00794-6","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136184889","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
Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time 针对较短时间依赖性工人步行时间的混合模型移动装配线材料放置优化
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-09-02 DOI: 10.1007/s10951-023-00787-5
Helmut A. Sedding
{"title":"Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time","authors":"Helmut A. Sedding","doi":"10.1007/s10951-023-00787-5","DOIUrl":"https://doi.org/10.1007/s10951-023-00787-5","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":" ","pages":""},"PeriodicalIF":2.0,"publicationDate":"2023-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47492117","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
Scheduling with periodic availability constraints to minimize makespan 具有周期性可用性约束的调度，以最大限度地缩短完工时间
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-08-17 DOI: 10.1007/s10951-023-00790-w
Li-Su Yu, Z. Tan
{"title":"Scheduling with periodic availability constraints to minimize makespan","authors":"Li-Su Yu, Z. Tan","doi":"10.1007/s10951-023-00790-w","DOIUrl":"https://doi.org/10.1007/s10951-023-00790-w","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":" ","pages":""},"PeriodicalIF":2.0,"publicationDate":"2023-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48087944","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
Block-based state-expanded network models for multi-activity shift scheduling 多活动轮班调度的基于块的状态扩展网络模型
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-07-22 DOI: 10.1007/s10951-023-00789-3
Michael Römer
{"title":"Block-based state-expanded network models for multi-activity shift scheduling","authors":"Michael Römer","doi":"10.1007/s10951-023-00789-3","DOIUrl":"https://doi.org/10.1007/s10951-023-00789-3","url":null,"abstract":"<p>This paper presents new mixed-integer linear programming formulations for multi-activity shift scheduling problems (MASSP). In these formulations, the rules governing shift feasibility are encoded in block-based state-expanded networks in which nodes are associated with states and arcs represent assignments of blocks of work or break periods inducing state transitions. A key advantage of these formulations is that for the anonymous MASSP in which all employees are considered as equal only a single network with integer flow variables is needed as long as the network encodes all shift composition rules. A challenging aspect is that the networks can become very large, yielding huge models that are hard to solve for large problem instances. To address this challenge, this paper proposes two exact modeling techniques that substantially reduce the size of the model instances: First, it introduces a set of aggregate side constraints enforcing that an integer flow solution can be decomposed into paths representing feasible shifts. Second, it proposes to decouple the shift composition from the assignment of concrete activities to blocks of work periods, thereby removing a large amount of symmetry from the original model. In a computational study with two MASSP instance sets from the literature dealing with shift scheduling problems, we demonstrate the effectiveness of these techniques for reducing the both size of the model instances and the solution time: We are able to solve all instances, including more than 70 previously open instances, to optimality–the vast majority of them in less than 30 min on a notebook computer.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"77 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2023-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138533297","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
Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines 受发布时间和截止日期约束的调度相关类型任务的固定参数可跟踪性
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-07-17 DOI: 10.1007/s10951-023-00788-4
C. Hanen, Alix Munier Kordon
{"title":"Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines","authors":"C. Hanen, Alix Munier Kordon","doi":"10.1007/s10951-023-00788-4","DOIUrl":"https://doi.org/10.1007/s10951-023-00788-4","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"1 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2023-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41689278","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}
引用次数: 2
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书