Scholarlink

The paper presents the method of solving problem of scheduling jobs by designers in IT project. The number of jobs and the number of designers are limited. The jobs depend on the fact that many jobs can be executed only after some others have been finished. The jobs of this type for real data are usually large. Their computational complexity is high. A genetic algorithm is proposed to solve the problem in a short time. Crossing and mutation operators have been identified which always gives acceptable solutions. Numerical results of the algorithm operation are shown and interpreted.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Genetic Algorithm for Solving a Scheduling Problem

  • 章节

  • 发表日期：

    2025年

查看全文
  • Rafał Burzyński,
  • Tadeusz Nowicki,
  • Robert Waszkowski

摘要

The paper presents the method of solving problem of scheduling jobs by designers in IT project. The number of jobs and the number of designers are limited. The jobs depend on the fact that many jobs can be executed only after some others have been finished. The jobs of this type for real data are usually large. Their computational complexity is high. A genetic algorithm is proposed to solve the problem in a short time. Crossing and mutation operators have been identified which always gives acceptable solutions. Numerical results of the algorithm operation are shown and interpreted.