Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs (Q4367301)
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: Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs |
scientific article; zbMATH DE number 1091579
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs |
scientific article; zbMATH DE number 1091579 |
Statements
25 November 1997
0 references
parallel machines
0 references
maximum earliness or tardiness
0 references
worst-case bounds
0 references
Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs (English)
0 references
0.96962965
0 references
0.9344219
0 references
0.91082644
0 references
0.9032602
0 references
0.9017736
0 references
0.9001045
0 references
0 references
0.89501005
0 references
0.89402914
0 references
