Worst-case analysis of heuristics for open shops with parallel machines-Reference-Cited by-同舟云学术

Worst-case analysis of heuristics for open shops with parallel machines

Published:1993-11 Issue:3 Volume:70 Page:379-390
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Chen Bo,Strusevich Vitaly A.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference24 articles.

1. A polynomial-time algorithm for approximate solution of a scheduling problem;Aksjonov;Upravljaemye Sistemy,1988

2. Nearly optimum solution of multimachine scheduling problems;Bárány;Szigma,1982

3. Branch and bound algorithm for a flowshop with multiple processors;Brah;European Journal of Operational Research,1991

4. A scheduling model for computer system with two classes of processors;Buten,1973

5. A property of LPT schedules;Chen,1992

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

1. Horae: A Hybrid I/O Request Scheduling Technique for Near-Data Processing-Based SSD;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2022-11

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 Shops;International Series in Operations Research & Management Science;2021-10-31

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

5. Review and classification of hybrid shop scheduling;Production Engineering;2018-06-12