Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times (Q2820105)
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: Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times |
scientific article; zbMATH DE number 6627268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times |
scientific article; zbMATH DE number 6627268 |
Statements
Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times (English)
0 references
13 September 2016
0 references
single machine scheduling
0 references
lower bound
0 references
upper bound
0 references
assignment problem
0 references
weighted completion time
0 references
equal processing times
0 references
release dates
0 references
0 references
0 references
0.8690218925476074
0 references
0.8505238890647888
0 references
0.8345533013343811
0 references
