Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time (Q940879)
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 5320607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time |
scientific article; zbMATH DE number 5320607 |
Statements
Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time (English)
0 references
3 September 2008
0 references
order scheduling
0 references
total weighted completion time
0 references
approximation algorithms
0 references
NP-hard
0 references
0 references
0 references
0 references
0.93476105
0 references
0 references
0.9143012
0 references
0.9103403
0 references
0.9098288
0 references
0.90775275
0 references
0.9061927
0 references
0.90595365
0 references
0.9039995
0 references
