Essays about: "university scheduling"

Showing result 11 - 15 of 28 essays containing the words university scheduling.

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

  3. 12. 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. 13. 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. 14. A comparison of sequencing formulations in a constraint generation procedure for avionics scheduling

    University essay from Linköpings universitet/Optimeringslära; Linköpings universitet/Tekniska fakulteten

    Author : Jessika Boberg; [2017]
    Keywords : Scheduling; avionics scheduling; multiprocessor scheduling; mixed integer programming;

    Abstract : This thesis compares different mixed integer programming (MIP) formulations for sequencing of tasks in the context of avionics scheduling. Sequencing is a key concern in many discrete optimisation problems, and there are numerous ways of accomplishing sequencing with different MIP formulations. READ MORE

  6. 15. How to Make Promotions Work in a Cost-efficient Context - A Case Study at Lantmännen

    University essay from Lunds universitet/Teknisk logistik

    Author : Caroline Vitasp; Helena Nyman; [2016]
    Keywords : Promotions; Promotion Planning; Cross‑functional Processes; Supply Chain Configuration; Strategy Alignment; Customer Service Level CSL ; Key Performance Indicators KPI ; Sales and Operations Planning S OP ; Master Scheduling MS ; Cost‑efficiency; Market Responsiveness; Technology and Engineering;

    Abstract : Problem -­‐‑ Promotions are the main reason for a majority of stock out situations and increases the amount of waste for perishable items, and strong competition within grocery retail has led to a significant increase in frequency and depth of promotions since the late 20th century. Lantmännen Cerealia has identified problems with low customer service levels (CSL) during promotions and lack of long term planning in general. READ MORE