Assignment of program modules to processors: a simulated annealing approach.
DOI10.1016/S0377-2217(99)00251-9zbMATH Open1068.90536OpenAlexW2073308632WikidataQ128121504 ScholiaQ128121504MaRDI QIDQ1582227FDOQ1582227
Authors: 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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Cites Work
Cited In (12)
- An adaptive partitioning algorithm for distributed discrete event simulation systems.
- Simulated annealing and the mapping problem: A computational study
- 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
- Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization
- Title not available (Why is that?)
- Combinatorial optimisation algorithms for a CAD workstation
- Using \(xQx\) to model and solve the uncapacitated task allocation problem
- An LC branch-and-bound algorithm for the module assignment problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- An improved discrete PSO for tugboat assignment problem under a hybrid scheduling rule in container terminal
This page was built for publication: Assignment of program modules to processors: a simulated annealing approach.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582227)