Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments-Reference-Cited by-同舟云学术

Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments

Published:2020-01-10 Issue:5 Volume:23 Page:595-608
ISSN:1094-6136
Container-title:Journal of Scheduling
language:en
Short-container-title:J Sched

Author:

Dong Jianming,Chang Joshua,Su Bing,Hu Jueliang,Lin Guohui^ORCID

Funder

National Natural Science Foundation of China

Natural Science Foundation of Zhejiang Province

Natural Sciences and Engineering Research Council of Canada

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Management Science and Operations Research,General Engineering,Software

Link

http://link.springer.com/content/pdf/10.1007/s10951-019-00633-7.pdf

Reference20 articles.

1. Chen, B., Glass, C. A., Potts, C. N., & Strusevich, V. A. (1996). A new heuristic for three-machine flow shop scheduling. Operations Research, 44, 891–898.

2. Dong, J., Tong, W., Luo, T., Wang, X., Hu, J., Xu, Y., et al. (2017). An FPTAS for the parallel two-machine flowshop problem. Theoretical Computer Science, 657, 64–72.

3. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: W. H. Freeman and Company.

4. Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1, 117–129.

5. Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. Journal of the ACM, 23, 665–679.

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

1. 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

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

3. Multiprocessor open shop problem: literature review and future directions;Journal of Combinatorial Optimization;2020-06-04