The complexity of two group scheduling problems (Q1860372)
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 1872734
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of two group scheduling problems |
scientific article; zbMATH DE number 1872734 |
Statements
The complexity of two group scheduling problems (English)
0 references
23 February 2003
0 references
scheduling
0 references
group technology
0 references
parallel machines
0 references
open shop
0 references
0 references
0.8707213997840881
0 references
0.8690917491912842
0 references
0.8648038506507874
0 references
0.8503751754760742
0 references
0.8395298719406128
0 references
