Essays about: "Scheduling Problem"

Showing result 6 - 10 of 220 essays containing the words Scheduling Problem.

  1. 6. 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

  3. 7. Efficiently Solving the Exact Cover Problem in OpenMP

    University essay from Umeå universitet/Institutionen för datavetenskap

    Author : Leo Hall; [2023]
    Keywords : Exact Cover; openmp; parallelization;

    Abstract : The exact cover problem is an NP-complete problem with many widespread use cases such as crew scheduling, railway scheduling, benchmarking as well as having applications in set theory. Existing algorithms can be slow when dealing with large datasets however. READ MORE

  4. 8. 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

  5. 9. An Evaluation of GeneticAlgorithm Approaches for theUnit Commitment Problem inPower Generation Scheduling

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Nandini Mattathil Suresh; [2023]
    Keywords : Unit Commitment Problem; Genetic Algorithm; Meta-heuristics; Economic Dispatch; Constrained Optimization; Encoding; Crossover; Mutation; Selection;

    Abstract : The Unit Commitment Problem (UCP) poses a significant challenge in optimizing powergeneration schedules within complex and dynamic energy systems. This study explores theapplication of Genetic Algorithms (GAs) as a promising approach to address UCP, their ability tonavigate complex solution spaces and adapt to changing operational conditions. READ MORE

  6. 10. 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