Finding a feasible course schedule using Tabu search
Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
Genetic programming (videotape): the movie
Genetic programming (videotape): the movie
Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
A tabu search heuristic for the vehicle routing problem
Management Science
Optimizing tabu list size for the traveling salesman problem
Computers and Operations Research
Tabu Search
Grid resource management: state of the art and future trends
Grid resource management: state of the art and future trends
AWIC'05 Proceedings of the Third international conference on Advances in Web Intelligence
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
Decision making for complex systems is based on multi-criterion-optimization. A decision making support can be applied to find the Pareto solutions. Multi-criterion tabu programming is a new paradigm for that task. Similarly to rules applied in the genetic programming, tabu programming solves problems by using a tabu algorithm that modifies some computer programs. We consider the multi-criterion problem of task assignment, where both a workload of a bottleneck computer and the cost of system are minimized; in contrast, a reliability of the distributed system is maximized. Furthermore, there are constraints for the performance of the distributed systems and the probability that all tasks meet their deadlines. What is more, constraints related to memory limits and computer locations are imposed on the feasible task assignment.