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

Journal of Scheduling最新文献

筛选
英文 中文
An exact solution with an improved running time for the routing flow shop problem with two machines 具有两个机器的路线流动车间问题的一个改进运行时间的精确解
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-04-30 DOI: 10.1007/s10951-023-00784-8
I. Chernykh, A. Kononov, S. Sevastyanov
{"title":"An exact solution with an improved running time for the routing flow shop problem with two machines","authors":"I. Chernykh, A. Kononov, S. Sevastyanov","doi":"10.1007/s10951-023-00784-8","DOIUrl":"https://doi.org/10.1007/s10951-023-00784-8","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":" ","pages":""},"PeriodicalIF":2.0,"publicationDate":"2023-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45467442","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
Dynamic personnel rescheduling: insights and recovery strategies 动态人员重新安排：见解和恢复策略
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-04-29 DOI: 10.1007/s10951-023-00785-7
B. Maenhout, M. Vanhoucke
{"title":"Dynamic personnel rescheduling: insights and recovery strategies","authors":"B. Maenhout, M. Vanhoucke","doi":"10.1007/s10951-023-00785-7","DOIUrl":"https://doi.org/10.1007/s10951-023-00785-7","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":" ","pages":""},"PeriodicalIF":2.0,"publicationDate":"2023-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46211660","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
Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling 基于偏好的多目标车间调度规则的自动演化
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-04-29 DOI: 10.1007/s10951-023-00783-9
Yannik Zeiträg, J. Figueira
{"title":"Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling","authors":"Yannik Zeiträg, J. Figueira","doi":"10.1007/s10951-023-00783-9","DOIUrl":"https://doi.org/10.1007/s10951-023-00783-9","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"26 1","pages":"289 - 314"},"PeriodicalIF":2.0,"publicationDate":"2023-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47327538","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
Preemptive scheduling of parallel jobs of two sizes with controllable processing times 具有可控处理时间的两种并行作业的抢占调度
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-04-07 DOI: 10.1007/s10951-023-00782-w
A. Shioura, V. Strusevich, N. V. Shakhlevich
{"title":"Preemptive scheduling of parallel jobs of two sizes with controllable processing times","authors":"A. Shioura, V. Strusevich, N. V. Shakhlevich","doi":"10.1007/s10951-023-00782-w","DOIUrl":"https://doi.org/10.1007/s10951-023-00782-w","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":" ","pages":""},"PeriodicalIF":2.0,"publicationDate":"2023-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42056881","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
Approximating weighted completion time via stronger negative correlation 通过更强的负相关逼近加权完井时间
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-03-30 DOI: 10.1007/s10951-023-00780-y
A. Baveja, Xiaoran Qu, A. Srinivasan
{"title":"Approximating weighted completion time via stronger negative correlation","authors":"A. Baveja, Xiaoran Qu, A. Srinivasan","doi":"10.1007/s10951-023-00780-y","DOIUrl":"https://doi.org/10.1007/s10951-023-00780-y","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":" ","pages":""},"PeriodicalIF":2.0,"publicationDate":"2023-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41742153","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
Competitive two-agent scheduling with release dates and preemption on a single machine 在单个机器上具有发布日期和抢占的竞争性双代理调度
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-03-27 DOI: 10.1007/s10951-023-00779-5
Shisheng Li, Ren-Xia Chen
{"title":"Competitive two-agent scheduling with release dates and preemption on a single machine","authors":"Shisheng Li, Ren-Xia Chen","doi":"10.1007/s10951-023-00779-5","DOIUrl":"https://doi.org/10.1007/s10951-023-00779-5","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"26 1","pages":"227 - 249"},"PeriodicalIF":2.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46685571","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 two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty 具有客观不确定性的延迟作业加权数最小化的两阶段鲁棒方法
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-02-07 DOI: 10.1007/s10951-022-00775-1
F. Clautiaux, Boris Detienne, H. Lefebvre
{"title":"A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty","authors":"F. Clautiaux, Boris Detienne, H. Lefebvre","doi":"10.1007/s10951-022-00775-1","DOIUrl":"https://doi.org/10.1007/s10951-022-00775-1","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"26 1","pages":"169 - 191"},"PeriodicalIF":2.0,"publicationDate":"2023-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42598538","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 note on the shifting bottleneck procedure for job shop scheduling 关于车间调度转移瓶颈过程的一个注记
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-01-25 DOI: 10.1007/s10951-022-00773-3
Murat Güngör
{"title":"A note on the shifting bottleneck procedure for job shop scheduling","authors":"Murat Güngör","doi":"10.1007/s10951-022-00773-3","DOIUrl":"https://doi.org/10.1007/s10951-022-00773-3","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"26 1","pages":"399 - 402"},"PeriodicalIF":2.0,"publicationDate":"2023-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47074543","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
Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms 多平台单调可塑任务调度的逼近算法
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-01-25 DOI: 10.1007/s10951-022-00774-2
Fangfang Wu, Zhongyi Jiang, Runnan Zhang, Xiandong Zhang
{"title":"Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms","authors":"Fangfang Wu, Zhongyi Jiang, Runnan Zhang, Xiandong Zhang","doi":"10.1007/s10951-022-00774-2","DOIUrl":"https://doi.org/10.1007/s10951-022-00774-2","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"26 1","pages":"383 - 398"},"PeriodicalIF":2.0,"publicationDate":"2023-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44752004","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: 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":"26 1","pages":"403 - 409"},"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
首页 上一页 下一页 尾页
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学术官方微信