Essays about: "Schemaläggning Problem"

Showing result 36 - 40 of 52 essays containing the words Schemaläggning Problem.

  1. 36. Effects of Different Worker Heuristics in Marriage in Honey Bees Optimization : As Applied to the Graph Coloring Problem

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

    Author : Lisa Li; Jakob Vyth; [2018]
    Keywords : ;

    Abstract : Marriage in Honey Bees Optimization (MBO) is an interesting meta-heuristic inspired by the mating process of honey bees, where worker bees are collectively responsible for raising the next generation of the colony. In MBO, worker bees are represented by heuristics that are used to navigate the search space. READ MORE

  3. 37. Investigating the Reliability of Known University Course Timetabling Problem Solving Algorithms with Updated Constraints

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

    Author : Robert Berggren; Timmy Nielsen; [2018]
    Keywords : ;

    Abstract : Scheduling lectures, exams, seminars etc. for a university turns out to be a harder task than what it seems to be at first glance. This problem is known as the University Course Timetabling Problem (UCTP). READ MORE

  4. 38. Comparing MAX-MIN and Rank-based Ant Colony Optimization Algorithms for solving the University Course Timetabling Problem

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

    Author : Felix Broberg; Emelie Eriksson; [2018]
    Keywords : ;

    Abstract : The University Course Timetabling Problem (UCTP) is a scheduling problem regarding courses, time slots and rooms, and is often accompanied by a set of feature requirements. As non-trivial instances of the UCTP are NP-hard, traditional computational methods are ineffective. READ MORE

  5. 39. Improving the performance of GPU-accelerated spatial joins

    University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Author : Dusan Viktor Hrstic; [2017]
    Keywords : GPU-acceleration; spatial joins; threads optimizations; warp scheduling; GPU-acceleration; rumsliga föreningar; optimering av trådar; warp schedulering;

    Abstract : Data collisions have been widely studied by various fields of science and industry. Combing CPU and GPU for processing spatial joins has been broadly accepted due to the increased speed of computations. READ MORE

  6. 40. A Multi-Objective Comparison of Resource Restriction Strategies in Checkout Queue Scheduling

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : Eric Hallström; Sasha Hellstenius; [2017]
    Keywords : Scheduling;

    Abstract : This paper deals with the comparison of how restrictions on resources affect the performance of task scheduling in light of a multi-criterion minimization of summarized flowtime and makespan. In order to investigate the performance of three different resource restriction strategies a simulation of the task scheduling problem was created and analyzed. READ MORE