Pages that link to "Item:Q835582"
From MaRDI portal
The following pages link to Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582):
Displaying 5 items.
- Flexible open shop scheduling problem to minimize makespan (Q342284) (← links)
- A projective algorithm for preemptive open shop scheduling with two multiprocessor groups (Q969520) (← links)
- Large-scale medical examination scheduling technology based on intelligent optimization (Q1740432) (← links)
- A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop (Q1792291) (← links)
- On a conjecture for the university timetabling problem (Q2028068) (← links)
