Approximation Algorithms for Three-Machine Open Shop Scheduling-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Approximation Algorithms for Three-Machine Open Shop Scheduling

Published:1993-08 Issue:3 Volume:5 Page:321-326
ISSN:0899-1499
Container-title:ORSA Journal on Computing
language:en
Short-container-title:ORSA Journal on Computing

Author:

Chen Bo,Strusevich Vitaly A.

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications,Information Systems,Software

Link

https://pubsonline.informs.org/doi/pdf/10.1287/ijoc.5.3.321

Cited by 39 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Complexity and approximation of open shop scheduling to minimize the makespan: A review of models and approaches;Computers & Operations Research;2022-08

2. General Open Shop Scheduling;International Series in Operations Research & Management Science;2021-10-31

3. A PTAS for non-resumable open shop scheduling with an availability constraint;Journal of Combinatorial Optimization;2021-07-02

4. Four decades of research on the open-shop scheduling problem to minimize the makespan;European Journal of Operational Research;2021-03

5. Solving Open Shop Scheduling Problem via Graph Attention Neural Network;2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI);2020-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP