Pages that link to "Item:Q1272356"
From MaRDI portal
The following pages link to A note on MULTIFIT scheduling for uniform machines (Q1272356):
Displaying 9 items.
- A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem (Q282256) (← links)
- On the exact upper bound for the Multifit processor scheduling algorithm (Q920838) (← links)
- Tighter bound for MULTIFIT scheduling on uniform processors (Q1175792) (← links)
- A linear compound algorithm for uniform machine scheduling (Q1266304) (← links)
- The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines (Q1304470) (← links)
- Approximation for scheduling on uniform nonsimultaneous parallel machines (Q1702658) (← links)
- Scheduling on uniform processors with at most one downtime on each machine (Q1751114) (← links)
- The multifit algorithm for set partitioning containing kernels (Q1807874) (← links)
- (Q3644530) (← links)