A polynomial algorithm for the [n/m/0, tij = 1, tree/Cmax] open shop problem-Reference-Cited by-同舟云学术

A polynomial algorithm for the [n/m/0, tij = 1, tree/Cmax] open shop problem

Published:1994-01 Issue:1 Volume:72 Page:125-134
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Bräsel H.,Kluge D.,Werner F.

Publisher

Elsevier BV

Subject

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

Reference9 articles.

1. Openshop and flowshop scheduling to minimize sum of completion times;Adiri;Computers & Operations Research,1984

2. Lateinische Rechtecke und Maschinenbelegung;Bräsel,1990

3. Bräsel, H., Kluge, D., and Werner, F., “A polynomial algorithm for the [n/m/0,tij = 1, tree/ΣCi]problem, submitted to Discrete Applied Mathematics.

4. Open shop scheduling to minimize finish time;Gonzales;Journal of the Association for Computing Machinery,1976

5. Computer aided complexity classification of deterministic scheduling problems;Lageweg,1981

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

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

2. On a Routing Open Shop Problem on Two Nodes with Unit Processing Times;Journal of Applied and Industrial Mathematics;2020-08

3. Open-shop scheduling for unit jobs under precedence constraints;Theoretical Computer Science;2020-01

4. Routing Open Shop with Two Nodes, Unit Processing Times and Equal Number of Jobs and Machines;Mathematical Optimization Theory and Operations Research;2019

5. Open-Shop Scheduling for Unit Jobs Under Precedence Constraints;Combinatorial Optimization and Applications;2018