A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs (Q1891237)
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 heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs |
scientific article; zbMATH DE number 759305
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs |
scientific article; zbMATH DE number 759305 |
Statements
A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs (English)
0 references
30 May 1995
0 references
identical parallel machines
0 references
different due dates and release times
0 references
0 references
0.8324428796768188
0 references
0.8257283568382263
0 references
0.8184551000595093
0 references
0.8157643675804138
0 references
