Essays about: "Schemaläggning Problem"

Showing result 26 - 30 of 52 essays containing the words Schemaläggning Problem.

1. 26. Extending Timing Analysis for Non­ Preemptive Task Sets on Multicore Under the AER Model

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

   Author : Jacob Kimblad; [2019]
   Keywords : ;

   Abstract : Real-time multi-core systems with shared memory are harder to analyze due to varying execution times caused by congestion in accessing the shared memory. A promising way to make these systems more deterministic is the Acquisition-Execution-Restitution (AER)-model which takes a memory-centric approach to scheduling which enables the multicore problem to be seen as a single core scheduling problem. READ MORE

3. 27. Analyzing the Improvement Potential of Workforce Scheduling with Focus on the Planning Process and Caregiver Continuity : A Case Study of a Swedish Home Care Planning System

   University essay from KTH/Optimeringslära och systemteori

   Author : Enkhzul Uyanga; Lida Wang; [2019]
   Keywords : Home Care; Workforce Scheduling System; Planning System; Mixed Integer Linear Programming; Heuristics; Caregiver Continuity; Hemtjänst; Schemaläggningssystem; Planeringssystem; Blandad Heltals Linjärprogrammering MILP ; Heuristik; Personalkontinuitet;

   Abstract : Swedish home care industry has been facing both external and internal problems, such as ageing population, varying quality and unsatisfactory continuity. Accordingly, workforce scheduling system, as one of the most common and useful software within home care planning nowadays, is in need of constant improvement and upgrading. READ MORE

4. 28. Local search hybridization of a genetic algorithm for solving the University Course Timetabling Problem

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

   Author : Mikael Forsberg; [2018]
   Keywords : Timetabling; University Course Timetabling Problem; Metaheuristics; Hybridization; Genetic Algorithm; Tabu Search; Schemaläggning; University Course Timetabling Problem; Metaheuristik; Hybridisering; Genetisk Algoritm; Tabusökning;

   Abstract : The University Course Timetabling Problem (UCTP) is the problem of assigning locations (lecture halls, computer rooms) and time slots (time and date) to a set of events (lectures, labs) while satisfying a number of constraints such as avoiding double-bookings. Many variants of problem formulations exist, and most realistic variants are thought to be NP-hard. READ MORE

5. 29. Towards Arc Consistency in PLAS

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

   Author : William Wieweg; [2018]
   Keywords : Constraint Programming; Scheduling; Planning; Symbolic constraints; Arc consistency; Villkorsprogrammering; Schemaläggning; Planering; Symboliska villkor; Bågkonsekvens;

   Abstract : The Planning And Scheduling (PLAS) module of ICE (Intelligent Control Environment) is responsible for planning and scheduling a large fleet of vehicles. This process involves the creation of tasks to be executed by the vehicles. READ MORE

6. 30. Shift Design and Driver Scheduling Problem

   University essay from KTH/Optimeringslära och systemteori

   Author : Criss Alvianto Priyanto; [2018]
   Keywords : Integer Linear Programming; Scheduling Problem; Shift-design problem; Genetic Algorithm; Simulated Annealing; Integer Linjar Programmering; Schemaläggning Problem; Skift Design;

   Abstract : Scheduling problem and shift design problems are well known NP-hard problems within the optimization area. Often time, the two problems are studied individually. In this thesis however, we are looking at the combination of both problems. READ MORE