Pages that link to "Item:Q3900978"
From MaRDI portal
The following pages link to Bounds on the Scheduling of Typed Task Systems (Q3900978):
Displaying 5 items.
- Efficient scheduling of tasks without full use of processor resources (Q1145998) (← links)
- A new approximation algorithm for UET-scheduling with chain-type precedence constraints. (Q1406686) (← links)
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
- Performance of Garey-Johnson algorithm for pipelined typed tasks systems (Q3002561) (← links)
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times (Q5888383) (← links)
