An algorithm for the multiprocessor assignment problem
From MaRDI portal
Publication:1822955
DOI10.1016/0167-6377(89)90022-9zbMath0679.68055OpenAlexW2078448419MaRDI QIDQ1822955
J. Z. Milis, Vangelis F. Magirou
Publication date: 1989
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(89)90022-9
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (17)
A survey for the quadratic assignment problem ⋮ A Lagrangian relaxation algorithm for sparse quadratic assignment problems ⋮ The Boolean quadratic programming problem with generalized upper bound constraints ⋮ Lower bounds for the quadratic semi-assignment problem ⋮ The task allocation problem with constant communication. ⋮ Algorithm for quadratic semi-assignment problem with partition size coefficients ⋮ An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating ⋮ An exact algorithm for the minimum squared load assignment problem ⋮ Exact solution of emerging quadratic assignment problems ⋮ Personnel placement in a fuzzy environment ⋮ An improved partial solution to the task assignment and multiway cut problems ⋮ Using \(xQx\) to model and solve the uncapacitated task allocation problem ⋮ Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique ⋮ Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search ⋮ An algorithm for the generalized quadratic assignment problem ⋮ A study of the quadratic semi-assignment polytope ⋮ A polynomially solvable class of quadratic semi-assignment problems
Cites Work
This page was built for publication: An algorithm for the multiprocessor assignment problem
