94-10

Polynomial Time Algorithms for Special Open Shop Problems with Precedence Constraints and Unit Processing Times.

by Braesel, H.; Kluge, D.; Werner, F.

 

Preprint series: 94-10, Preprints

The paper is published: RAIRO Operations Research, Vol. 30, 1996, No. 1, 65 - 79.

MSC:
90B35 Scheduling theory, See also {68M20}

 

Keywords: open shop scheduling, polynomial algorithm, precedence constraints, unit time problems


The author(s) agree, that this abstract may be stored asfull text and distributed as such by abstracting services.

Letzte Änderung: 01.03.2018 - Ansprechpartner: Webmaster