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

Journal of Scheduling最新文献

筛选
英文 中文
A large neighborhood search approach for the paint shop scheduling problem 涂料车间调度问题的一种大邻域搜索方法
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2021-12-02 DOI: 10.1007/s10951-021-00713-7
Felix Winter, Nysret Musliu
{"title":"A large neighborhood search approach for the paint shop scheduling problem","authors":"Felix Winter, Nysret Musliu","doi":"10.1007/s10951-021-00713-7","DOIUrl":"https://doi.org/10.1007/s10951-021-00713-7","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"25 1","pages":"453 - 475"},"PeriodicalIF":2.0,"publicationDate":"2021-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42942823","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
Scheduling computations with provably low synchronization overheads 具有可证明的低同步开销的调度计算
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2021-10-21 DOI: 10.1007/s10951-021-00706-6
Guilherme Rito, Hervé Paulino
{"title":"Scheduling computations with provably low synchronization overheads","authors":"Guilherme Rito, Hervé Paulino","doi":"10.1007/s10951-021-00706-6","DOIUrl":"https://doi.org/10.1007/s10951-021-00706-6","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"25 1","pages":"107 - 124"},"PeriodicalIF":2.0,"publicationDate":"2021-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43580843","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
Optimally rescheduling jobs with a Last-In-First-Out buffer 使用后进先出缓冲区优化重新安排作业
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2021-09-21 DOI: 10.1007/s10951-021-00707-5
G. Nicosia, A. Pacifici, Ulrich Pferschy, J. Resch, G. Righini
{"title":"Optimally rescheduling jobs with a Last-In-First-Out buffer","authors":"G. Nicosia, A. Pacifici, Ulrich Pferschy, J. Resch, G. Righini","doi":"10.1007/s10951-021-00707-5","DOIUrl":"https://doi.org/10.1007/s10951-021-00707-5","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"24 1","pages":"663 - 680"},"PeriodicalIF":2.0,"publicationDate":"2021-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43879404","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
Local search approaches for the test laboratory scheduling problem with variable task grouping 可变任务分组测试实验室调度问题的局部搜索方法
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2021-09-13 DOI: 10.1007/s10951-021-00699-2
Florian Mischek, Nysret Musliu, Andrea Schaerf
{"title":"Local search approaches for the test laboratory scheduling problem with variable task grouping","authors":"Florian Mischek, Nysret Musliu, Andrea Schaerf","doi":"10.1007/s10951-021-00699-2","DOIUrl":"https://doi.org/10.1007/s10951-021-00699-2","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"26 1","pages":"457 - 477"},"PeriodicalIF":2.0,"publicationDate":"2021-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44062966","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
Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time 关于调度具有优先级约束的单位长度作业以最小化总完成时间的三点注意事项
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2021-09-09 DOI: 10.1007/s10951-021-00702-w
Tianyu Wang, Odile Bellenguez
{"title":"Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time","authors":"Tianyu Wang, Odile Bellenguez","doi":"10.1007/s10951-021-00702-w","DOIUrl":"https://doi.org/10.1007/s10951-021-00702-w","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"24 1","pages":"649 - 662"},"PeriodicalIF":2.0,"publicationDate":"2021-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48031718","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
Theoretical and practical issues in single-machine scheduling with two job release and delivery times 具有两个作业发布和交付时间的单机调度的理论和实践问题
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2021-09-09 DOI: 10.1007/s10951-021-00708-4
Alejandro Reynoso, N. Vakhania
{"title":"Theoretical and practical issues in single-machine scheduling with two job release and delivery times","authors":"Alejandro Reynoso, N. Vakhania","doi":"10.1007/s10951-021-00708-4","DOIUrl":"https://doi.org/10.1007/s10951-021-00708-4","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"11 6","pages":"615 - 647"},"PeriodicalIF":2.0,"publicationDate":"2021-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41288913","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
New Perspectives in Scheduling Theory 调度理论的新视角
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2021-08-24 DOI: 10.1007/s10951-021-00693-8
J. Błażewicz, Benjamin Moseley, E. Pesch, D. Trystram, Guochuan Zhang
{"title":"New Perspectives in Scheduling Theory","authors":"J. Błażewicz, Benjamin Moseley, E. Pesch, D. Trystram, Guochuan Zhang","doi":"10.1007/s10951-021-00693-8","DOIUrl":"https://doi.org/10.1007/s10951-021-00693-8","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"24 1","pages":"455 - 457"},"PeriodicalIF":2.0,"publicationDate":"2021-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10951-021-00693-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44642253","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
A note on the complexity of two supply chain scheduling problems 关于两个供应链调度问题复杂性的注记
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2021-08-01 DOI: 10.1007/s10951-021-00692-9
Yuan Zhang, Jinjiang Yuan
{"title":"A note on the complexity of two supply chain scheduling problems","authors":"Yuan Zhang, Jinjiang Yuan","doi":"10.1007/s10951-021-00692-9","DOIUrl":"https://doi.org/10.1007/s10951-021-00692-9","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"24 1","pages":"447 - 454"},"PeriodicalIF":2.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10951-021-00692-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43143217","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
Online scheduling to minimize total weighted (modified) earliness and tardiness cost 在线调度以最小化总加权(修正)早迟到成本
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2021-08-01 DOI: 10.1007/s10951-021-00698-3
Arman Jabbari, Philip M. Kaminsky
{"title":"Online scheduling to minimize total weighted (modified) earliness and tardiness cost","authors":"Arman Jabbari, Philip M. Kaminsky","doi":"10.1007/s10951-021-00698-3","DOIUrl":"https://doi.org/10.1007/s10951-021-00698-3","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"24 1","pages":"431 - 446"},"PeriodicalIF":2.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10951-021-00698-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48223444","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 memetic algorithm to address the multi-node resource-constrained project scheduling problem 解决多节点资源受限项目调度问题的模因算法
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2021-07-27 DOI: 10.1007/s10951-021-00696-5
Luis F. Machado-Domínguez, Carlos D. Paternina-Arboleda, J.I. Velez, Agustín Barrios-Sarmiento
{"title":"A memetic algorithm to address the multi-node resource-constrained project scheduling problem","authors":"Luis F. Machado-Domínguez, Carlos D. Paternina-Arboleda, J.I. Velez, Agustín Barrios-Sarmiento","doi":"10.1007/s10951-021-00696-5","DOIUrl":"https://doi.org/10.1007/s10951-021-00696-5","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"24 1","pages":"413 - 429"},"PeriodicalIF":2.0,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10951-021-00696-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44785408","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学术文献互助群
群 号：481959085
Book学术官方微信