Pages that link to "Item:Q902062"
From MaRDI portal
The following pages link to On the complexity of constructing multiprocessor little-preemptive schedules (Q902062):
Displaying 6 items.
- A note on the proof of the complexity of the little-preemptive open-shop problem (Q763116) (← links)
- On the complexity of preemptive open-shop scheduling problems (Q1058969) (← links)
- Little-preemptive scheduling on unrelated processors (Q1868263) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- (Q4791888) (← links)
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness (Q5961604) (← links)