Partial solutions and multifit algorithm for multiprocessor scheduling

DOI10.1007/S10852-014-9262-ZzbMATH Open1330.90034OpenAlexW1997682349MaRDI QIDQ894528FDOQ894528

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

approximation algorithmsidentical parallel machinesmultiprocessor scheduling\textit{MultiFit}

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Search techniques for a nonlinear multiprocessor scheduling problem
• A composite algorithm for multiprocessor scheduling
• Tighter Bounds for the Multifit Processor Scheduling Algorithm
• The longest processing time rule for identical parallel machines revisited
• Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times
• Title not available (Why is that?)

   Recommendations

• A parallel approximation scheme for the multiprocessor scheduling problem 👍 👎
• Tighter Bounds for the Multifit Processor Scheduling Algorithm 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)