On the complexity of constructing multiprocessor little-preemptive schedules (Q902062): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the geometry, preemptions and complexity of multiprocessor and shop scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on the proof of the complexity of the little-preemptive open-shop problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3075100 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4536419 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4681923 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal rounding gives a better approximation for scheduling unrelated machines / rank | |||
Normal rank | |||
Revision as of 07:48, 11 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of constructing multiprocessor little-preemptive schedules |
scientific article |
Statements
On the complexity of constructing multiprocessor little-preemptive schedules (English)
0 references
7 January 2016
0 references
open shop problem
0 references
