Assignment of program modules to processors: a simulated annealing approach.

DOI10.1016/S0377-2217(99)00251-9zbMath1068.90536WikidataQ128121504 ScholiaQ128121504MaRDI QIDQ1582227

Yskandar Hamam, Khalil S. Hindi

Publication date: 14 January 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00251-9

zbMATH Keywords

Combinatorial optimization; Simulated annealing; Computer networks; Task assignment

Mathematics Subject Classification ID

90B18: Communication networks in operations research

68M10: Network design and communication in computer systems

90C59: Approximation methods and heuristics in mathematical programming

90B10: Deterministic network models in operations research

90C27: Combinatorial optimization

Related Items

Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization, An improved discrete PSO for tugboat assignment problem under a hybrid scheduling rule in container terminal, Bi-objective task assignment in heterogeneous distributed systems using honeybee mating optimization, Multicanonical jump walk annealing assisted by tabu for dynamic optimization of chemical engineering processes, Using \(xQx\) to model and solve the uncapacitated task allocation problem

Cites Work

• Assignment of Tasks in a Distributed Processor System with Limited Memory
• An efficient algorithm for a task allocation problem
• Unnamed Item