Partial solutions and multifit algorithm for multiprocessor scheduling
From MaRDI portal
(Redirected from Publication:894528)
Recommendations
- A parallel approximation scheme for the multiprocessor scheduling problem
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
- scientific article; zbMATH DE number 1979517
- scientific article; zbMATH DE number 67289
- On the exact upper bound for the Multifit processor scheduling algorithm
- Some algorithms of solving minimax multiprocessor scheduling problem
- Multiprocessor scheduling with machine allotment and parallelism constraints
- An algorithm for the multiprocessor assignment problem
- A composite algorithm for multiprocessor scheduling
Cites work
- scientific article; zbMATH DE number 3989090 (Why is no real title available?)
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1302193 (Why is no real title available?)
- scientific article; zbMATH DE number 1175952 (Why is no real title available?)
- scientific article; zbMATH DE number 1783886 (Why is no real title available?)
- A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors
- A composite algorithm for multiprocessor scheduling
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- A linear time approximation algorithm for multiprocessor scheduling
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- A short note on an advance in estimating the worst-case performance ratio of the MPS algorithm
- A state-of-the-art review of parallel-machine scheduling research
- An Application of Bin-Packing to Multiprocessor Scheduling
- An exact algorithm for the identical parallel machine scheduling problem.
- Applying tabu search with influential diversification to multiprocessor scheduling
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Design and evaluation of tabu search algorithms for multiprocessor scheduling
- Heuristic and exact algorithms for the identical parallel machine scheduling problem
- Improved 0/1-interchange scheduling
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem
- Multiprocessor scheduling: Combining LPT and MULTIFIT
- On the exact upper bound for the Multifit processor scheduling algorithm
- Optimal Scheduling of Tasks on Identical Parallel Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling. Theory, algorithms, and systems.
- Tight bounds for the identical parallel machine scheduling problem
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
Cited in
(6)- scientific article; zbMATH DE number 1870573 (Why is no real title available?)
- Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
- A composite algorithm for multiprocessor scheduling
- The longest processing time rule for identical parallel machines revisited
- Search techniques for a nonlinear multiprocessor scheduling problem
This page was built for publication: Partial solutions and multifit algorithm for multiprocessor scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894528)
