Makespan minimization in open shops: A polynomial time approximation scheme

Author:

Sevastianov Sergey V.,Woeginger Gerhard J.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Reference13 articles.

1. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in Handbooks in Operations Research and Management Science, vol. 4, North Holland, Amsterdam, 1993, pp. 445–522.

2. T. Gonzalez, S. Sahni, Open shop scheduling to minimize finish time, Journal of the Association of Computing Machinery 23 (1976) 665–679.

3. I. Bárány, T. Fiala, Nearly optimum solution of multimachine scheduling problems, Szigma Mathematika Közgazdasági Folyóirat 15 (1982) 177–191 (in Hungarian).

4. V.A. Aksjonov, A polynomial-time algorithm for an approximate solution of a scheduling problem, Upravlyaemye Sistemy 28 (1988) 8–11 (in Russian).

5. B. Chen, V.A. Strusevich, Approximation algorithms for three-machine open shop scheduling, ORSA Journal on Computing 5 (1993) 321–326.

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

1. Scheduling in manufacturing with transportation: Classification and solution techniques;European Journal of Operational Research;2023-10

2. An Algebraic Approach to the Solutions of the Open Shop Scheduling Problem;2023 IEEE 13th International Conference on Pattern Recognition Systems (ICPRS);2023-07-04

3. An Algebraic Approach to the Solutions of the Open Shop Scheduling Problem;Computation;2023-05-08

4. Moderate exponential-time algorithms for scheduling problems;4OR;2022-11-05

5. A polynomial time approximation scheme for the scheduling problem in the AGV system;2022 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS);2022-10-23

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3