Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (Q5932283)
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 1596032
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments |
scientific article; zbMATH DE number 1596032 |
Statements
Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (English)
0 references
7 May 2001
0 references
job shop
0 references
branch-and-bound
0 references
constraint propagation
0 references
benchmark problems
0 references
Jackson's preemptive schedule
0 references
0.8521884
0 references
0.8456137
0 references
0.8447174
0 references
0.8427801
0 references
0.8391917
0 references
0.8345053
0 references
0.83309585
0 references
