Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
RAIRO - Operations Research - Recherche Opérationnelle, Tome 30 (1996) no. 1, pp. 65-79. 
@article{RO_1996__30_1_65_0,
     author = {Br\"asel, Heidemarie and Kluge, Dagmar and Werner, Frank},
     title = {Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {65--79},
     publisher = {EDP-Sciences},
     volume = {30},
     number = {1},
     year = {1996},
     mrnumber = {1399985},
     zbl = {0857.90057},
     language = {en},
     url = {http://www.numdam.org/item/RO_1996__30_1_65_0/}
}
TY  - JOUR
AU  - Bräsel, Heidemarie
AU  - Kluge, Dagmar
AU  - Werner, Frank
TI  - Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1996
SP  - 65
EP  - 79
VL  - 30
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/RO_1996__30_1_65_0/
LA  - en
ID  - RO_1996__30_1_65_0
ER  - 
%0 Journal Article
%A Bräsel, Heidemarie
%A Kluge, Dagmar
%A Werner, Frank
%T Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1996
%P 65-79
%V 30
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/RO_1996__30_1_65_0/
%G en
%F RO_1996__30_1_65_0
Bräsel, Heidemarie; Kluge, Dagmar; Werner, Frank. Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times. RAIRO - Operations Research - Recherche Opérationnelle, Tome 30 (1996) no. 1, pp. 65-79. http://www.numdam.org/item/RO_1996__30_1_65_0/

1. H. Bräsel, Lateinische Rechtecke und Maschinenbelegung, Habilitationsschrift, TU Magdeburg, 1990.

2. H. Bräsel and M. Kleinau, On number problems for the open shop problem. System Modelling and Optimization, Proceedings of the 15th 1FIP Conference, Zurich, Switzerland, Springer-Verlag, 1992, pp. 145-155. | MR | Zbl

3. H. Bräsel, D. Kluge and F. Werner, A polynomial algorithm for the [ n/m/O, tij, tree/Cmax] open shop problem, European J. Oper. Res., 1994, 72, pp. 125-134. | Zbl

4. H. Bräsel, D. Kluge and F. Werner, A polynomial algorithm for an open shop problem with unit processing times and tree constraints, to appear 1994 in Discrete Applied Mathematics. | MR | Zbl

5. P. Brucker, B. Jurisch and M. Jurisch, Open shop problems with Unit time operations, ZOR, 1993, 37, pp. 59-73. | MR | Zbl

6. P. Brucker, B. Jurisch, T. Tautenhahn and F. Werner, Scheduling unit time open shops to minimize the weighted number of late jobs, OR Letters, 1994, 14, pp. 245-250. | MR | Zbl

7. R. E. Graham, E. L. Lawlwer and J. K. Lenstra, Rinnooy Kan, A. H. G.: Optimization and approximation in deterministic sequencing and scheduling - a survey, Ann. Discrete Mathematics, 1979, 5, pp. 287-326. | MR | Zbl

8. T. Gonzales and S. Sahni, Open shop scheduling to minimize finish time, J. Assoc. Comput. Mach., 1976, 23, pp. 665-679. | MR | Zbl

9. W. Kubiak, C. Sriskandarajah and K. Zaras, A note on the complexity of open-shop scheduling problems, INFOR, 1991, 29, pp. 284-294. | Zbl

10. C. Y. Liu and R. L. Bulfin, Scheduling open shops with unit execution times to minimize functions of due dates, Operations Research, 1988, 36, No. 4, pp. 553-559. | MR | Zbl

11. R. Mcnaughton, Scheduling with deadlines and loss functions, Management Science, 1959, 6, pp. 1-12. | MR | Zbl

12. V. S. Tanaev, Sotskov, N. Yu and V. A. Strusevich, Scheduling theory. Multistage system, Kluwer Academie Publishers, 1994. | Zbl

13. T. Tautenhahn Open-shop-Probleme mit Einheitsbearbeitungszeiten, Dissertation, Otto-von-Guericke-Universitàt, Magdeburg, 1993.