The problems of handling time inIP-based automatic scheduling

Erdős, Szilvia [Erdős, Szilvia (informatika), szerző] Automatizálási és Alkalmazott Informatikai Tanszék (BME / VIK); 3in-BME Balatonfüredi Hallgatói Kutatócsoport (BME / VIK / EIT)

Angol nyelvű Tudományos Konferenciaközlemény (Könyvrészlet)
    Azonosítók
    • MTMT: 31849930
    Szakterületek:
      The automatic generation of schedules has been in the focus of researchesfor decades. One of the main problems of every scheduling is the handling of time.Final exam scheduling is a special subtask of the generation of schedules, wherespecial requirements restrict the state space. An adequate solution was given to asimplified version of it, which was based on an integer linear programming approach.In this case, time was regarded as fixed timeslots without any variation in it.To get the real-life final exam scheduling, I had to expand the simplified model.The main deficiency was that this time exams should be parallelly scheduled, whichdo not start at the same time, and the exams can have different lengths too. The timewas examined in 5 minutes timeslots, which caused lots of unknown problems, and thestate space has exploded.The problems and solution opportunities are investigated. The more complicatedrequirements are theoretically solvable, but unmanageable in practice. The resultsshow that without reduction on the requirements, the extended problem with thesesegmentations is not solvable.
      Hivatkozás stílusok: IEEEACMAPAChicagoHarvardCSLMásolásNyomtatás
      2021-10-21 00:03