New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan (Q1761791)
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 6107342
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan |
scientific article; zbMATH DE number 6107342 |
Statements
New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan (English)
0 references
15 November 2012
0 references
scheduling
0 references
open shop
0 references
comparability graph
0 references
reducibility
0 references
complexity
0 references
0.8698210716247559
0 references
0.8410244584083557
0 references
0.8355650305747986
0 references
0.8355644941329956
0 references
