Open shop problems with unit time operations-Reference-Cited by-同舟云学术

Open shop problems with unit time operations

Published:1993-02 Issue:1 Volume:37 Page:59-73
ISSN:0340-9422
Container-title:ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research
language:en
Short-container-title:ZOR - Methods and Models of Operations Research

Author:

Brucker Peter,Jurisch Bernd,Jurisch Marion

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01415528.pdf

Reference32 articles.

1. Bräsel H (1990) Lateinische Rechtecke und Maschinenbelegung, Dissertation B, TU Magdeburg

2. Bräsel H, Kluge D, Werner F (1991) A polynomial algorithm for then¦m¦O¦t ij =1;tree¦C max problem, to appear in EJOR

3. Bräsel H, Kluge D, Werner F (1991a) A polynomial algorithm for an open shop problem with unit processing times and tree constraints, Preprint, Technische Universität Otto von Guericke, Magdeburg

4. Bräsel H, Kluge D, Werner F (1992) A polynomial time algorithm for a 2-machine open shop problem with precedence constraints and unit processing times, Preprint, Technische Universität Otto von Guericke, Magdeburg

5. Brucker P, Garey MR, Johnson DS (1977) Scheduling equal-length tasks under treelike precedence constrains to minimize maximum lateness. Math. Oper. Res. 2:275?284

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

1. Dynamic Programming algorithms and their applications in machine scheduling: A review;Expert Systems with Applications;2022-03

2. A Matheuristic Approach to the Open Shop Scheduling Problem with Sequence-Dependent Setup Times*;IFAC-PapersOnLine;2022

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

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

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