Optimal scheduling of queueing networks with switching times using genetic algorithms

  • Authors:
  • Podvalny Semen;Titov Sergey;Burkovsky Viktor;Semynin Sergey

  • Affiliations:
  • Automation and Informatics in Technical Systems, Voronezh Technical State University, Voronezh, Russia;Automation and Informatics in Technical Systems, Voronezh Technical State University, Voronezh, Russia;Automation and Informatics in Technical Systems, Voronezh Technical State University, Voronezh, Russia;Automation and Informatics in Technical Systems, Voronezh Technical State University, Voronezh, Russia

  • Venue:
  • ACMOS'06 Proceedings of the 8th WSEAS international conference on Automatic control, modeling & simulation
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we consider the problem of optimal scheduling of queueing networks with switching times based on genetic algorithms approach. We propose a special chromosome encoding scheme, crossover and mutation operators. Deterministic mutation is used to prevent premature convergence to a poor solution. Finally, results of computational experiments are included to compare deterministic mutation with classical probabilistic one.