A lower bound for the job insertion problem. (Q1811122)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A lower bound for the job insertion problem. |
scientific article; zbMATH DE number 1925296
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for the job insertion problem. |
scientific article; zbMATH DE number 1925296 |
Statements
A lower bound for the job insertion problem. (English)
0 references
10 June 2003
0 references
Job-shop scheduling
0 references
Perfect graphs
0 references
Polyhedral methods
0 references
0 references
0 references
0.8963318
0 references
0.86822337
0 references
0.85238475
0 references
0.8490336
0 references
0 references
0.84279656
0 references
0.8407452
0 references
0.8389402
0 references
0.83818203
0 references
