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 this page instead for the normal view: Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags |
scientific article |
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
