Minimization of mean flow time for some discrete-continuous scheduling problems (Q1368686)
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: Minimization of mean flow time for some discrete-continuous scheduling problems |
scientific article; zbMATH DE number 1067863
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimization of mean flow time for some discrete-continuous scheduling problems |
scientific article; zbMATH DE number 1067863 |
Statements
Minimization of mean flow time for some discrete-continuous scheduling problems (English)
0 references
29 September 1997
0 references
independent, nonpreemptable jobs
0 references
parallel machines
0 references
continuously divisible, renewable resources
0 references
mean flow time
0 references
0.9372058510780334
0 references
0.8509120941162109
0 references
0.848279595375061
0 references
0.8478191494941711
0 references
