BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS (Q3392290)
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 5595192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS |
scientific article; zbMATH DE number 5595192 |
Statements
BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS (English)
0 references
14 August 2009
0 references
scheduling
0 references
single machine
0 references
linear earliness
0 references
quadratic tardiness
0 references
beam search
0 references
heuristics
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.91668504
0 references
0.9009926
0 references
0.89925194
0 references
0.8927753
0 references
0.88961536
0 references
0.88015854
0 references
0.8797308
0 references
0.8783681
0 references
