Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem (Q1273117)
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: Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem |
scientific article; zbMATH DE number 1229555
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem |
scientific article; zbMATH DE number 1229555 |
Statements
Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem (English)
0 references
6 December 1998
0 references
parallel processors
0 references
lower bound
0 references
Jackson's pseudo preemptive schedule
0 references
parallel and identical processor scheduling
0 references
makespan
0 references
resource constrained project scheduling
0 references
