Single machine scheduling problem with interval processing times to minimize mean weighted completion time (Q337133)
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 6650711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single machine scheduling problem with interval processing times to minimize mean weighted completion time |
scientific article; zbMATH DE number 6650711 |
Statements
Single machine scheduling problem with interval processing times to minimize mean weighted completion time (English)
0 references
10 November 2016
0 references
scheduling
0 references
single machine
0 references
mean completion time
0 references
uncertainty
0 references
heuristics
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.844417929649353
0 references
0.8404551148414612
0 references
0.830990195274353
0 references
0.8159955739974976
0 references
