Job selection in a heavily loaded shop (Q1373892)
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 1091597
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Job selection in a heavily loaded shop |
scientific article; zbMATH DE number 1091597 |
Statements
Job selection in a heavily loaded shop (English)
0 references
1997
0 references
job selection
0 references
heavily loaded shop
0 references
branch-and-bound
0 references
NP-hard
0 references
pseudo-polynomial time algorithms
0 references
0 references
0.8508232831954956
0 references
0.7853276133537292
0 references
0.7742667198181152
0 references
0.7636924982070923
0 references
