Tighter Bounds for the Multifit Processor Scheduling Algorithm
From MaRDI portal
Recommendations
- Tighter bound for MULTIFIT scheduling on uniform processors
- On the exact upper bound for the Multifit processor scheduling algorithm
- New bounds on time and number of processors for multiprocessor optimal schedules
- Partial solutions and multifit algorithm for multiprocessor scheduling
- Tighter Bounds for LPT Scheduling on Uniform Processors
- scientific article; zbMATH DE number 1979517
- An LPT-bound for a parallel multiprocessor scheduling problem
- Multiprocessor scheduling by generalized extremal optimization
- Lower bound algorithms for multiprocessor task scheduling with ready times
Cited in
(48)- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
- Fair cost-sharing methods for scheduling jobs on parallel machines
- First fit decreasing scheduling on uniform multiprocessors
- On the worst-case ratio of a compound multiprocessor scheduling algorithm
- Multiprocessor scheduling: Combining LPT and MULTIFIT
- Tighter bound for MULTIFIT scheduling on uniform processors
- A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling
- A note on MULTIFIT scheduling for uniform machines
- The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
- Performance of scheduling algorithms for no-wait flowshops with parallel machines
- Worst-case analysis of heuristics for open shops with parallel machines
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- Minimizing the makespan on two identical parallel machines with mold constraints
- The multifit algorithm for set partitioning containing kernels
- Approximability of scheduling with fixed jobs
- Exact performance of MULTIFIT for nonsimultaneous machines
- A dynamic edge covering and scheduling problem: complexity results and approximation algorithms
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Parallel machine scheduling with nested processing set restrictions
- scientific article; zbMATH DE number 3843135 (Why is no real title available?)
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime
- scientific article; zbMATH DE number 3898232 (Why is no real title available?)
- Generalized worst-case bounds for an homogeneous multiprocessor model with independent memories—Completion time performance criterion
- Evaluation of a MULTIFIT-based scheduling algorithm
- On a special case of uniform processor scheduling
- scientific article; zbMATH DE number 1080288 (Why is no real title available?)
- Heuristic scheduling of parallel machines with sequence-dependent set-up times
- scientific article; zbMATH DE number 1863264 (Why is no real title available?)
- scientific article; zbMATH DE number 895358 (Why is no real title available?)
- scientific article; zbMATH DE number 1446769 (Why is no real title available?)
- Unrelated parallel machine scheduling -- perspectives and progress
- Better permutations for the single-processor scheduling with time restrictions
- scientific article; zbMATH DE number 2230249 (Why is no real title available?)
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- Performance of the LPT algorithm in multiprocessor scheduling
- Tight performance bounds of CP-scheduling on out-trees
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem
- Combinatorics for multiprocessor scheduling optimization and other contexts in computer architecture
- Non-clairvoyant makespan minimization scheduling with predictions
- Efficient approximation schemes for scheduling on a stochastic number of machines
- Parallel machines scheduling with nonsimultaneous machine available time
- Performance ratios of the Karmarkar-Karp differencing method
- Scheduling web advertisements: a note on the minspace problem
- Partial solutions and multifit algorithm for multiprocessor scheduling
- Scheduling and fixed-parameter tractability
- Scheduling batches on parallel machines with major and minor set-ups
- A state-of-the-art review of parallel-machine scheduling research
- On the exact upper bound for the Multifit processor scheduling algorithm
This page was built for publication: Tighter Bounds for the Multifit Processor Scheduling Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3326834)
