Pages that link to "Item:Q920838"
From MaRDI portal
The following pages link to On the exact upper bound for the Multifit processor scheduling algorithm (Q920838):
Displayed 10 items.
- Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176) (← links)
- Performance ratios of the Karmarkar-Karp differencing method (Q867023) (← links)
- Tighter bound for MULTIFIT scheduling on uniform processors (Q1175792) (← links)
- A tighter bound for FFd algorithm (Q1594856) (← links)
- The effect of machine availability on the worst-case performance of LPT (Q1775060) (← links)
- Parallel machine scheduling under a grade of service provision (Q1879792) (← links)
- An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212) (← links)
- A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately (Q5436247) (← links)
- (Q5708542) (← links)