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 15 items.
- Flexible open shop scheduling problem to minimize makespan (Q342284) (← links)
- On the complexity of constructing multiprocessor little-preemptive schedules (Q902062) (← links)
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887) (← links)
- A projective algorithm for preemptive open shop scheduling with two multiprocessor groups (Q969520) (← links)
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource (Q1186309) (← links)
- On the solution region for certain scheduling problems with preemption (Q1273129) (← links)
- Multiprofessor scheduling (Q1686063) (← links)
- Partially concurrent open shop scheduling with integral preemptions (Q1698281) (← 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)
- Restrictions and preassignments in preemptive open shop scheduling (Q1917354) (← links)
- On a conjecture for the university timetabling problem (Q2028068) (← links)
- A preemptive open shop scheduling problem with one resource (Q2641218) (← links)
- Scheduling with centralized and decentralized batching policies in concurrent open shops (Q2994798) (← links)
- Preemptive scheduling with dedicated processors: applications of fractional graph coloring (Q5892097) (← links)
