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

Journal of Scheduling最新文献

筛选
英文 中文
Project scheduling in a lean environment to maximize value and minimize overruns 在精益环境中进行项目调度，以实现价值最大化并最大限度地减少超支
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-03-20 DOI: 10.1007/s10951-022-00727-9
Claudio Szwarcfiter, Y. Herer, A. Shtub
{"title":"Project scheduling in a lean environment to maximize value and minimize overruns","authors":"Claudio Szwarcfiter, Y. Herer, A. Shtub","doi":"10.1007/s10951-022-00727-9","DOIUrl":"https://doi.org/10.1007/s10951-022-00727-9","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47847073","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
Single-machine scheduling with resource-dependent processing times and multiple unavailability periods 具有资源相关处理时间和多个不可用期的单机调度
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-03-11 DOI: 10.1007/s10951-022-00723-z
Byung-Cheon Choi, Myoung-Ju Park
{"title":"Single-machine scheduling with resource-dependent processing times and multiple unavailability periods","authors":"Byung-Cheon Choi, Myoung-Ju Park","doi":"10.1007/s10951-022-00723-z","DOIUrl":"https://doi.org/10.1007/s10951-022-00723-z","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44154289","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}
引用次数: 3
A graph-based MIP formulation of the International Timetabling Competition 2019 2019年国际时间表比赛的基于图形的MIP公式
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-03-11 DOI: 10.1007/s10951-022-00724-y
Dennis S. Holm, R. Mikkelsen, Matias Sørensen, Thomas J. R. Stidsen
{"title":"A graph-based MIP formulation of the International Timetabling Competition 2019","authors":"Dennis S. Holm, R. Mikkelsen, Matias Sørensen, Thomas J. R. Stidsen","doi":"10.1007/s10951-022-00724-y","DOIUrl":"https://doi.org/10.1007/s10951-022-00724-y","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47431656","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}
引用次数: 12
Optimizing rest times and differences in games played: an iterative two-phase approach 优化休息时间和游戏差异:一个迭代的两阶段方法
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-03-07 DOI: 10.1007/s10951-021-00717-3
David Van Bulck, Dries R. Goossens
{"title":"Optimizing rest times and differences in games played: an iterative two-phase approach","authors":"David Van Bulck, Dries R. Goossens","doi":"10.1007/s10951-021-00717-3","DOIUrl":"https://doi.org/10.1007/s10951-021-00717-3","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46812131","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}
引用次数: 3
Approximation algorithms for batch scheduling with processing set restrictions 具有处理集限制的批调度近似算法
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-03-05 DOI: 10.1007/s10951-022-00720-2
Xing Chai, Wenhua Li, C. T. Ng, T. Cheng
{"title":"Approximation algorithms for batch scheduling with processing set restrictions","authors":"Xing Chai, Wenhua Li, C. T. Ng, T. Cheng","doi":"10.1007/s10951-022-00720-2","DOIUrl":"https://doi.org/10.1007/s10951-022-00720-2","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41475778","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
A mixed-integer programming approach for solving university course timetabling problems 求解高校课程编排问题的混合整数规划方法
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-02-15 DOI: 10.1007/s10951-021-00715-5
Efstratios Rappos, Eric Thiémard, Stephan Robert, Jean-François Hêche
{"title":"A mixed-integer programming approach for solving university course timetabling problems","authors":"Efstratios Rappos, Eric Thiémard, Stephan Robert, Jean-François Hêche","doi":"10.1007/s10951-021-00715-5","DOIUrl":"https://doi.org/10.1007/s10951-021-00715-5","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42171168","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}
引用次数: 11
An analysis of the parameterized complexity of periodic timetabling 周期调度的参数化复杂度分析
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-02-15 DOI: 10.1007/s10951-021-00719-1
Niels Lindner, Julian Reisch
{"title":"An analysis of the parameterized complexity of periodic timetabling","authors":"Niels Lindner, Julian Reisch","doi":"10.1007/s10951-021-00719-1","DOIUrl":"https://doi.org/10.1007/s10951-021-00719-1","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52494598","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}
引用次数: 8
Editorial: Journal of Scheduling (2022) 社论:Journal of Scheduling (2022)
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-02-01 DOI: 10.1007/s10951-023-00776-8
E. Burke
{"title":"Editorial: Journal of Scheduling (2022)","authors":"E. Burke","doi":"10.1007/s10951-023-00776-8","DOIUrl":"https://doi.org/10.1007/s10951-023-00776-8","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45931404","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
Advances in the practice and theory of automated timetabling. 自动化排课的实践与理论进展。
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-01-01 Epub Date: 2022-06-16 DOI: 10.1007/s10951-022-00746-6
Ender Özcan, Patrick De Causmaecker, Greet Vanden Berghe
{"title":"Advances in the practice and theory of automated timetabling.","authors":"Ender Özcan, Patrick De Causmaecker, Greet Vanden Berghe","doi":"10.1007/s10951-022-00746-6","DOIUrl":"https://doi.org/10.1007/s10951-022-00746-6","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9200940/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40164738","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}
引用次数: 1
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times. 具有周期性维护、作业拒绝和加权完成时间和的并行机器调度问题的禁忌搜索。
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-01-01 Epub Date: 2021-10-17 DOI: 10.1007/s10951-021-00711-9
Hanane Krim, Nicolas Zufferey, Jean-Yves Potvin, Rachid Benmansour, David Duvivier
{"title":"Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times.","authors":"Hanane Krim,&nbsp;Nicolas Zufferey,&nbsp;Jean-Yves Potvin,&nbsp;Rachid Benmansour,&nbsp;David Duvivier","doi":"10.1007/s10951-021-00711-9","DOIUrl":"https://doi.org/10.1007/s10951-021-00711-9","url":null,"abstract":"<p><p>We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach, due to a natural hierarchy among the two objectives in the applications considered. The main contributions of this paper are first to present a new problem relevant to practice, second, to develop a mixed-integer-linear-program model for the problem, and third, to introduce two generalizable tabu-search metaheuristics relying on different neighborhood structures and solution spaces. Computational results for 120 instances (generated from a real case) are reported to empirically demonstrate the effectiveness of the proposed metaheuristics.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8929393/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40325313","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}
引用次数: 4
首页 上一页 下一页 尾页
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学术官方微信