Essays about: "Schemaläggning Problem"

Showing result 1 - 5 of 52 essays containing the words Schemaläggning Problem.

  1. 1. Dynamic container orchestration for a device-cloud continuum

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Camilo Alfonso Rodriguez Garzon; [2023]
    Keywords : Edge computing; kubernetes operator; dynamic scheduling; Edge computing; Kubernetes-operatör; dynamisk schemaläggning;

    Abstract : Edge computing has emerged as a paradigm to support the growing demand for real-time processing of data generated at the edge of the network. As the devices at the edge are constrained, one of the challenges in the area is how to schedule workloads. READ MORE

  3. 2. Simultaneous scheduling of railway maintenance and trains : Modelling and solving train interactions close to a maintenance operation

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Pauline Vaillant; [2023]
    Keywords : Optimization; Linear programming; Heuristics; Railway scheduling; Maintenance planning; Optimering; Linjärprogrammering; Heuristik; Järnvägsplanering; Underhållsplanering;

    Abstract : Rail transport plays a key role in the mobility of passengers and goods. It is expected to grow the decarbonization of society. In that context, it is important to use the railway network efficiently, and jointly planning trains and network maintenance allows for better use of resources. READ MORE

  4. 3. CPU vs GPU performance when solving the flexible job-shop problem using genetic algorithms

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Love Göransson; Marcus Nilszén; [2023]
    Keywords : ;

    Abstract : In this thesis, a comparison is made between the performance of genetic algorithms executed on the CPU and the GPU for solving the Flexible Job-shop Scheduling Problem (FJSP). The purpose is to determine whether one processing unit offers better performance than the other. READ MORE

  5. 4. Empirical Evaluation of Construction Methods for Relaxed Decision Diagrams in Scheduling

    University essay from Linköpings universitet/Programvara och system

    Author : Dennis Berntsson; [2023]
    Keywords : Decision diagrams; Discrete optimization; Dynamic programming; Scheduling; Top-down compilation; Incremental refinement;

    Abstract : Decision diagrams have recently emerged as a promising approach for difficult scheduling problems, along with other challenging discrete optimization problems. Decision diagrams can offer a compact representation of the solution space, and has the ability to capture complex constraints that are hard to model or express in other techniques. READ MORE

  6. 5. An ILP-model for the Train platforming problem

    University essay from Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Author : Simon Calderon; [2023]
    Keywords : Optimization; Integer programming; Train platforming; Train scheduling; Optimering; Heltalsprogrammering; Tåg; Järnväg; Schemaläggning;

    Abstract : The goal of this thesis is to create an optimization model to optimize the routing of trains within railway stations. This problem is known as the train platforming problem, and the model we present is an integer programming model. By this model we aim to optimize factors such as walking distance, switch usage or platform usage. READ MORE