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

Comput. Oper. Res.最新文献

筛选
英文 中文
Data-driven distributionally robust surgery planning in flexible operating rooms over a Wasserstein ambiguity 基于Wasserstein模糊的灵活手术室中数据驱动的分布式健壮手术计划
Comput. Oper. Res. Pub Date : 2021-03-28 DOI: 10.1016/j.cor.2022.105927
K. Shehadeh
{"title":"Data-driven distributionally robust surgery planning in flexible operating rooms over a Wasserstein ambiguity","authors":"K. Shehadeh","doi":"10.1016/j.cor.2022.105927","DOIUrl":"https://doi.org/10.1016/j.cor.2022.105927","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"62 1","pages":"105927"},"PeriodicalIF":0.0,"publicationDate":"2021-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82334249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
An analysis of network and resource indicators for resource-constrained project scheduling problem instances 资源约束项目调度问题实例的网络和资源指标分析
Comput. Oper. Res. Pub Date : 2021-03-14 DOI: 10.1016/J.COR.2021.105260
M. Vanhoucke, J. Coelho
{"title":"An analysis of network and resource indicators for resource-constrained project scheduling problem instances","authors":"M. Vanhoucke, J. Coelho","doi":"10.1016/J.COR.2021.105260","DOIUrl":"https://doi.org/10.1016/J.COR.2021.105260","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"222 3 1","pages":"105260"},"PeriodicalIF":0.0,"publicationDate":"2021-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72684316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Distributionally robust facility location with bimodal random demand 具有双峰随机需求的分布鲁棒设施选址
Comput. Oper. Res. Pub Date : 2021-03-08 DOI: 10.1016/J.COR.2021.105257
K. Shehadeh, Ece Sanci
{"title":"Distributionally robust facility location with bimodal random demand","authors":"K. Shehadeh, Ece Sanci","doi":"10.1016/J.COR.2021.105257","DOIUrl":"https://doi.org/10.1016/J.COR.2021.105257","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"9 1","pages":"105257"},"PeriodicalIF":0.0,"publicationDate":"2021-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73634432","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Solution approaches for integrated vehicle and crew scheduling with electric buses 电动客车车辆与人员综合调度的解决方法
Comput. Oper. Res. Pub Date : 2021-03-08 DOI: 10.1016/J.COR.2021.105268
Shyam S. G. Perumal, T. Dollevoet, D. Huisman, R. Lusby, J. Larsen, M. Riis
{"title":"Solution approaches for integrated vehicle and crew scheduling with electric buses","authors":"Shyam S. G. Perumal, T. Dollevoet, D. Huisman, R. Lusby, J. Larsen, M. Riis","doi":"10.1016/J.COR.2021.105268","DOIUrl":"https://doi.org/10.1016/J.COR.2021.105268","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"90 1","pages":"105268"},"PeriodicalIF":0.0,"publicationDate":"2021-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77905193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 28
Benders decomposition for a period-aggregated resource leveling problem with variable job duration 具有可变作业持续时间的周期聚合资源均衡问题的弯曲者分解
Comput. Oper. Res. Pub Date : 2021-03-08 DOI: 10.1016/J.COR.2021.105258
I. Tarasov, A. Haït, O. Battaïa
{"title":"Benders decomposition for a period-aggregated resource leveling problem with variable job duration","authors":"I. Tarasov, A. Haït, O. Battaïa","doi":"10.1016/J.COR.2021.105258","DOIUrl":"https://doi.org/10.1016/J.COR.2021.105258","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"19 1","pages":"105258"},"PeriodicalIF":0.0,"publicationDate":"2021-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84240217","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times 具有运输和装配时间的柔性作业车间调度问题的混合多目标进化算法
Comput. Oper. Res. Pub Date : 2021-03-08 DOI: 10.1016/J.COR.2021.105263
Jinghe Sun, Guohui Zhang, Jiao Lu, Wenqiang Zhang
{"title":"A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times","authors":"Jinghe Sun, Guohui Zhang, Jiao Lu, Wenqiang Zhang","doi":"10.1016/J.COR.2021.105263","DOIUrl":"https://doi.org/10.1016/J.COR.2021.105263","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"230 1","pages":"105263"},"PeriodicalIF":0.0,"publicationDate":"2021-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89049807","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 26
A unified approach for an approximation of tandem queues with failures and blocking under several types of service-failure interactions 几种类型的服务故障交互下具有故障和阻塞的串联队列近似的统一方法
Comput. Oper. Res. Pub Date : 2021-03-01 DOI: 10.1016/j.cor.2020.105161
Y. Shin, D. Moon
{"title":"A unified approach for an approximation of tandem queues with failures and blocking under several types of service-failure interactions","authors":"Y. Shin, D. Moon","doi":"10.1016/j.cor.2020.105161","DOIUrl":"https://doi.org/10.1016/j.cor.2020.105161","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"7 1","pages":"105161"},"PeriodicalIF":0.0,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73375734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem 双目标双层走廊分配问题的混合整数线性规划模型及有效算法
Comput. Oper. Res. Pub Date : 2021-03-01 DOI: 10.1016/J.COR.2021.105283
Chao Guan, Zeqiang Zhang, Juhua Gong, Silu Liu
{"title":"Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem","authors":"Chao Guan, Zeqiang Zhang, Juhua Gong, Silu Liu","doi":"10.1016/J.COR.2021.105283","DOIUrl":"https://doi.org/10.1016/J.COR.2021.105283","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"7 1","pages":"105283"},"PeriodicalIF":0.0,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78706894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
The single-vehicle two-echelon one-commodity pickup and delivery problem 一辆车两梯队一件商品的取送问题
Comput. Oper. Res. Pub Date : 2021-03-01 DOI: 10.1016/j.cor.2020.105152
Hipólito Hernández-Pérez, M. Landete, Inmaculada Rodríguez Martín
{"title":"The single-vehicle two-echelon one-commodity pickup and delivery problem","authors":"Hipólito Hernández-Pérez, M. Landete, Inmaculada Rodríguez Martín","doi":"10.1016/j.cor.2020.105152","DOIUrl":"https://doi.org/10.1016/j.cor.2020.105152","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"108 1","pages":"105152"},"PeriodicalIF":0.0,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74659106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs 序列依赖代价条件下选择性拆卸排序问题的启发式求解方法
Comput. Oper. Res. Pub Date : 2021-03-01 DOI: 10.1016/j.ifacol.2019.11.481
J. Jeunet, F. D. Croce, F. Salassa
{"title":"Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs","authors":"J. Jeunet, F. D. Croce, F. Salassa","doi":"10.1016/j.ifacol.2019.11.481","DOIUrl":"https://doi.org/10.1016/j.ifacol.2019.11.481","url":null,"abstract":"","PeriodicalId":10582,"journal":{"name":"Comput. Oper. Res.","volume":"33 1","pages":"105151"},"PeriodicalIF":0.0,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73112687","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
首页 上一页 下一页 尾页
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学术官方微信