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

Journal of Scheduling最新文献

筛选
英文 中文
Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion–Exclusion 基于包容-排斥的置换流水调度问题的中等最坏情况复杂度界
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-10-18 DOI: 10.1007/s10951-022-00759-1
Olivier Ploton, V. T’kindt
{"title":"Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion–Exclusion","authors":"Olivier Ploton, V. T’kindt","doi":"10.1007/s10951-022-00759-1","DOIUrl":"https://doi.org/10.1007/s10951-022-00759-1","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"26 1","pages":"137 - 145"},"PeriodicalIF":2.0,"publicationDate":"2022-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47045862","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
Scheduling a pick and place packaging line 安排取放包装生产线
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-10-18 DOI: 10.1007/s10951-022-00755-5
Tommaso Schettini, F. Malucelli, H. Ramalhinho
{"title":"Scheduling a pick and place packaging line","authors":"Tommaso Schettini, F. Malucelli, H. Ramalhinho","doi":"10.1007/s10951-022-00755-5","DOIUrl":"https://doi.org/10.1007/s10951-022-00755-5","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"26 1","pages":"113 - 136"},"PeriodicalIF":2.0,"publicationDate":"2022-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48102506","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
Parallel solutions for preemptive makespan scheduling on two identical machines 两台相同机器上抢占式最大作业时间调度的并行解决方案
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-10-11 DOI: 10.1007/s10951-022-00764-4
L. Epstein
{"title":"Parallel solutions for preemptive makespan scheduling on two identical machines","authors":"L. Epstein","doi":"10.1007/s10951-022-00764-4","DOIUrl":"https://doi.org/10.1007/s10951-022-00764-4","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"26 1","pages":"61 - 76"},"PeriodicalIF":2.0,"publicationDate":"2022-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44872297","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
Optimization of scheduling problems with deterioration effects and an optional maintenance activity 具有退化效应和可选维护活动的调度问题的优化
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-10-07 DOI: 10.1007/s10951-022-00756-4
Xinyu Sun, Tao Liu, Xin-Na Geng, Yang Hu, Jing-Xiao Xu
{"title":"Optimization of scheduling problems with deterioration effects and an optional maintenance activity","authors":"Xinyu Sun, Tao Liu, Xin-Na Geng, Yang Hu, Jing-Xiao Xu","doi":"10.1007/s10951-022-00756-4","DOIUrl":"https://doi.org/10.1007/s10951-022-00756-4","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"26 1","pages":"251 - 266"},"PeriodicalIF":2.0,"publicationDate":"2022-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41729531","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}
引用次数: 4
Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs 带后进先出缓冲区的作业重调度算法，以最小化延迟作业的加权数
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-10-07 DOI: 10.1007/s10951-022-00751-9
Ulrich Pferschy, Julia Resch, G. Righini
{"title":"Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs","authors":"Ulrich Pferschy, Julia Resch, G. Righini","doi":"10.1007/s10951-022-00751-9","DOIUrl":"https://doi.org/10.1007/s10951-022-00751-9","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"26 1","pages":"267 - 287"},"PeriodicalIF":2.0,"publicationDate":"2022-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47537886","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 a single-shift days-off scheduling problem with sequence-dependent labor costs 关于具有序列相关人工成本的单班休假计划问题的一个注记
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-10-06 DOI: 10.1007/s10951-022-00749-3
E. Mizutani, Kevin Alexander Sánchez Galeano
{"title":"A note on a single-shift days-off scheduling problem with sequence-dependent labor costs","authors":"E. Mizutani, Kevin Alexander Sánchez Galeano","doi":"10.1007/s10951-022-00749-3","DOIUrl":"https://doi.org/10.1007/s10951-022-00749-3","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"26 1","pages":"315 - 329"},"PeriodicalIF":2.0,"publicationDate":"2022-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44166425","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
Packing-based branch-and-bound for discrete malleable task scheduling 离散可延展任务调度的基于包装的分支定界
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-09-22 DOI: 10.1007/s10951-022-00750-w
Roland Braune
{"title":"Packing-based branch-and-bound for discrete malleable task scheduling","authors":"Roland Braune","doi":"10.1007/s10951-022-00750-w","DOIUrl":"https://doi.org/10.1007/s10951-022-00750-w","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"25 1","pages":"675 - 704"},"PeriodicalIF":2.0,"publicationDate":"2022-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48844075","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
Preemptive and non-preemptive scheduling on two unrelated parallel machines 两个无关并行机上的抢占和非抢占调度
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-09-21 DOI: 10.1007/s10951-022-00753-7
A. Soper, V. Strusevich
{"title":"Preemptive and non-preemptive scheduling on two unrelated parallel machines","authors":"A. Soper, V. Strusevich","doi":"10.1007/s10951-022-00753-7","DOIUrl":"https://doi.org/10.1007/s10951-022-00753-7","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"15 8","pages":"659 - 674"},"PeriodicalIF":2.0,"publicationDate":"2022-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41249759","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 to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection 在有界拒绝作业的并行机器上，调度以最大化准时作业的加权数量
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-09-16 DOI: 10.1007/s10951-022-00745-7
Matan Atsmony, G. Mosheiov
{"title":"Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection","authors":"Matan Atsmony, G. Mosheiov","doi":"10.1007/s10951-022-00745-7","DOIUrl":"https://doi.org/10.1007/s10951-022-00745-7","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"26 1","pages":"193 - 207"},"PeriodicalIF":2.0,"publicationDate":"2022-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48494686","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
Robust finite-horizon scheduling/rescheduling of operating rooms with elective and emergency surgeries under resource constraints 资源约束下具有选择性和紧急手术的手术室鲁棒有限视界调度/重新调度
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2022-09-13 DOI: 10.1007/s10951-022-00741-x
F. Davarian, J. Behnamian
{"title":"Robust finite-horizon scheduling/rescheduling of operating rooms with elective and emergency surgeries under resource constraints","authors":"F. Davarian, J. Behnamian","doi":"10.1007/s10951-022-00741-x","DOIUrl":"https://doi.org/10.1007/s10951-022-00741-x","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"25 1","pages":"625 - 641"},"PeriodicalIF":2.0,"publicationDate":"2022-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43940529","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学术官方微信