Pages that link to "Item:Q3326834"
From MaRDI portal
The following pages link to Tighter Bounds for the Multifit Processor Scheduling Algorithm (Q3326834):
Displayed 22 items.
- Scheduling algorithms for flexible flowshops: Worst and average case performance (Q583096) (← links)
- Performance of the LPT algorithm in multiprocessor scheduling (Q583889) (← links)
- Parallel machines scheduling with nonsimultaneous machine available time (Q757232) (← links)
- Performance ratios of the Karmarkar-Karp differencing method (Q867023) (← links)
- Scheduling web advertisements: a note on the minspace problem (Q880489) (← links)
- Scheduling batches on parallel machines with major and minor set-ups (Q918855) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- On the exact upper bound for the Multifit processor scheduling algorithm (Q920838) (← links)
- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint (Q1009206) (← links)
- Fair cost-sharing methods for scheduling jobs on parallel machines (Q1026241) (← links)
- On the worst-case ratio of a compound multiprocessor scheduling algorithm (Q1097028) (← links)
- Multiprocessor scheduling: Combining LPT and MULTIFIT (Q1109673) (← links)
- Tighter bound for MULTIFIT scheduling on uniform processors (Q1175792) (← links)
- A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling (Q1210221) (← links)
- Performance of scheduling algorithms for no-wait flowshops with parallel machines (Q1310022) (← links)
- Worst-case analysis of heuristics for open shops with parallel machines (Q1310023) (← links)
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (Q1318519) (← links)
- Approximability of scheduling with fixed jobs (Q1964484) (← links)
- An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212) (← links)
- Parallel machine scheduling with nested processing set restrictions (Q2655610) (← links)
- Heuristic scheduling of parallel machines with sequence-dependent set-up times (Q4443334) (← links)
- (Q5708542) (← links)