Maximizing set function formulation of two scheduling problems (Q4015963)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 70147
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing set function formulation of two scheduling problems |
scientific article; zbMATH DE number 70147 |
Statements
Maximizing set function formulation of two scheduling problems (English)
0 references
12 November 1992
0 references
single machine
0 references
total weighted earliness and tardiness
0 references
parallel identical processors
0 references
weighted mean flow time
0 references
submodular set function
0 references
heuristic algorithm
0 references
0 references
0.8660399
0 references
0.8614785
0 references
0.85857564
0 references
0.85689735
0 references
0.85526013
0 references
0.8447472
0 references
0.8430358
0 references
