A greedy heuristic for the mean tardiness sequencing problem (Q1317079)
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: A greedy heuristic for the mean tardiness sequencing problem |
scientific article; zbMATH DE number 527452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A greedy heuristic for the mean tardiness sequencing problem |
scientific article; zbMATH DE number 527452 |
Statements
A greedy heuristic for the mean tardiness sequencing problem (English)
0 references
26 September 1994
0 references
mean tardiness problem
0 references
sequencing a set of jobs
0 references
single processor
0 references
average tardiness
0 references
heuristics
0 references
0 references
0.8814505338668823
0 references
0.8794732689857483
0 references
0.8500373363494873
0 references
0.8500373363494873
0 references
