Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times (Q2820105)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times |
scientific article |
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
