Partial solutions and multifit algorithm for multiprocessor scheduling

DOI10.1007/s10852-014-9262-zzbMath1330.90034OpenAlexW1997682349MaRDI QIDQ894528

Alex J. Ruiz-Torres, Giuseppe Paletta

Publication date: 1 December 2015

Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-014-9262-z

zbMATH Keywords

multiprocessor schedulingapproximation algorithmsidentical parallel machines\textit{MultiFit}

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

The longest processing time rule for identical parallel machines revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A composite algorithm for multiprocessor scheduling
• Minimizing the makespan in nonpreemptive parallel machine scheduling problem
• A state-of-the-art review of parallel-machine scheduling research
• On the exact upper bound for the Multifit processor scheduling algorithm
• Multiprocessor scheduling: Combining LPT and MULTIFIT
• Improved 0/1-interchange scheduling
• Design and evaluation of tabu search algorithms for multiprocessor scheduling
• A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
• Applying tabu search with influential diversification to multiprocessor scheduling
• An exact algorithm for the identical parallel machine scheduling problem.
• A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
• Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
• A linear time approximation algorithm for multiprocessor scheduling
• A Short Note on an Advance in Estimating the Worst-Case Performance Ratio of the MPS Algorithm
• Tighter Bounds for the Multifit Processor Scheduling Algorithm
• Tight bounds for the identical parallel machine scheduling problem
• A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors
• An Application of Bin-Packing to Multiprocessor Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Scheduling

This page was built for publication: Partial solutions and multifit algorithm for multiprocessor scheduling