The single-server scheduling problem with convex costs (Q1945446)
From MaRDI portal
!
WARNING
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 6151426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The single-server scheduling problem with convex costs |
scientific article; zbMATH DE number 6151426 |
Statements
The single-server scheduling problem with convex costs (English)
0 references
8 April 2013
0 references
scheduling
0 references
production control
0 references
queuing systems
0 references
dynamic priorities
0 references
\(c\mu \)-rule
0 references
0 references
0 references
0 references
0.878218948841095
0 references
0.878218948841095
0 references
0.8589149117469788
0 references
0.8164665699005127
0 references
0.814307689666748
0 references
