Solving timetable scheduling problem using genetic algorithms

B. Sigl · Marin Golub · Vedran Mornar

55 citations0/0 files storedIEEE Transactions on Image Processing

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Scheduling and Timetabling Solutions Scheduling and Optimization Algorithms Constraint Satisfaction and Optimization

Abstract

A genetic algorithm for solving a timetable scheduling problem is described. The algorithm was tested on small and large instances of the problem. Algorithm performance was significantly enhanced with modification of basic genetic operators. Intelligent operators restrain the creation of new conflicts in the individual and improve the overall algorithm 's behavior.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 55 citations exist upstream.

References

1995A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems

Cited by

2018Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem 2010Fuzzy Genetic Heuristic for University Course Timetable Problem 2021A Compromise Programming for Multi-Objective Task Assignment Problem

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.