Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags (Q2564876)
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 962137
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags |
scientific article; zbMATH DE number 962137 |
Statements
Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags (English)
0 references
7 January 1997
0 references
multiple operations
0 references
time-lags
0 references
NP-hardness
0 references
worst-case analysis
0 references
single machine scheduling
0 references
polynomially bounded heuristic algorithms
0 references
0.8981137
0 references
0.8911359
0 references
0.8726336
0 references
0.8726121
0 references
0.87191004
0 references
0.8709582
0 references
0.8706547
0 references
0.8699328
0 references
0.8699296
0 references
