Pages that link to "Item:Q1306374"
From MaRDI portal
The following pages link to Optimal scheduling on parallel machines for a new order class (Q1306374):
Displaying 11 items.
- An efficient parallel algorithm for scheduling interval ordered tasks (Q652455) (← links)
- Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time (Q940879) (← links)
- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (Q1013298) (← links)
- A polynomial algorithm for recognizing the \(\mathcal A\)-order class (Q1043599) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Exact methods for order acceptance and scheduling on unrelated parallel machines (Q1725610) (← links)
- Scheduling unitary task systems with zero--one communication delays for quasi-interval orders (Q1811068) (← links)
- Optimal preemptive scheduling on a fixed number of identical parallel machines (Q2488216) (← links)
- Non-preemptive profile scheduling and quasi-interval orders (Q2741353) (← links)
- A new polynomial algorithm for a parallel identical scheduling problem (Q3517881) (← links)
- Un nouveau concept de dominance pour l'ordonnancement de travaux sur une machine (Q3686481) (← links)
