Pages that link to "Item:Q3660919"
From MaRDI portal
The following pages link to Bounds for Multifit Scheduling on Uniform Processors (Q3660919):
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)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- Fair cost-sharing methods for scheduling jobs on parallel machines (Q1026241) (← links)
- First fit decreasing scheduling on uniform multiprocessors (Q1061602) (← links)
- Tighter bound for MULTIFIT scheduling on uniform processors (Q1175792) (← links)
- A note on MULTIFIT scheduling for uniform machines (Q1272356) (← 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)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
- Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations (Q2398648) (← links)
- An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212) (← links)
- Performance of Heuristics for a Computer Resource Allocation Problem (Q3313258) (← links)
- Approximation scheduling algorithms: a survey (Q4207781) (← links)
