Open-shop scheduling for unit jobs under precedence constraints (Q5919645)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7116390
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Open-shop scheduling for unit jobs under precedence constraints |
scientific article; zbMATH DE number 7116390 |
Statements
Open-shop scheduling for unit jobs under precedence constraints (English)
0 references
11 October 2019
0 references
open-shop scheduling
0 references
precedence constraint
0 references
directed acyclic graph
0 references
approximation algorithm
0 references
0.9991428256034852
0 references
0.948897123336792
0 references
0.8421536087989807
0 references
0.802603006362915
0 references
