An algorithm for constructing single machine schedules based on ant colony approach

Authors:
V. A. Kostenko;A. V. Plakunov
Affiliations:
Moscow State University, Moscow, Russia 119991;Moscow State University, Moscow, Russia 119991
Venue:
Journal of Computer and Systems Sciences International
Year:
2013

Citing 6
Cited 0

Introduction to algorithms

Introduction to algorithms
ACO algorithms for the quadratic assignment problem

New ideas in optimization
Ant Algorithms: Theory and Applications

Programming and Computing Software
An Algorithm for Scheduling Exchanges over a Bus with Centralized Control and an Analysis of Its Efficiency

Programming and Computing Software
Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Optimizing integrated application performance with cache-aware metascheduling

OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

A mathematical statement of the problem of building a schedule of data exchange over a channel with centralized control is presented. This problem arises in the design of real-time management information systems (MISs). Various approaches to the design of ant colony algorithms are analyzed, and experimental comparison of the proposed algorithm with greedy algorithms is performed.