Scheduling jobs of equal length: Complexity, facets and computational results (Q1919094)
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 912381
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling jobs of equal length: Complexity, facets and computational results |
scientific article; zbMATH DE number 912381 |
Statements
Scheduling jobs of equal length: Complexity, facets and computational results (English)
0 references
1 August 1996
0 references
automated assembly of printed circuit boards
0 references
single machine
0 references
polyhedral description
0 references
cutting plane algorithm
0 references
0 references
0 references
0.9660125374794006
0 references
0.7943500280380249
0 references
0.7896912693977356
0 references
