Pages that link to "Item:Q1175792"
From MaRDI portal
The following pages link to Tighter bound for MULTIFIT scheduling on uniform processors (Q1175792):
Displaying 6 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 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)
- Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations (Q2398648) (← links)
