Analysis of a linearization heuristic for single-machine scheduling to maximize profit (Q3313596)
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: Analysis of a linearization heuristic for single-machine scheduling to maximize profit |
scientific article; zbMATH DE number 3843475
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of a linearization heuristic for single-machine scheduling to maximize profit |
scientific article; zbMATH DE number 3843475 |
Statements
Analysis of a linearization heuristic for single-machine scheduling to maximize profit (English)
0 references
1984
0 references
heuristic algorithm
0 references
no preemption
0 references
maximization of total profit
0 references
single machine
0 references
0 references
0 references
0.7895494699478149
0 references
0.7744376063346863
0 references
0.7725875377655029
0 references
