Pages that link to "Item:Q1175792"
From MaRDI portal
The following pages link to Tighter bound for MULTIFIT scheduling on uniform processors (Q1175792):
Displaying 15 items.
- A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem (Q282256) (← links)
- Moderately exponential approximation for makespan minimization on related machines (Q392019) (← links)
- Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture (Q783686) (← links)
- On the exact upper bound for the Multifit processor scheduling algorithm (Q920838) (← links)
- First fit decreasing scheduling on uniform multiprocessors (Q1061602) (← links)
- Multiprocessor scheduling: Combining LPT and MULTIFIT (Q1109673) (← links)
- A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling (Q1210221) (← links)
- A note on MULTIFIT scheduling for uniform machines (Q1272356) (← 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)
- Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations (Q2398648) (← links)
- Exact performance of MULTIFIT for nonsimultaneous machines (Q2440111) (← links)
- Generalized multifit-type methods. II (Q2714178) (← links)
- Tighter Bounds for the Multifit Processor Scheduling Algorithm (Q3326834) (← links)
