Sökning: "Dynamic job scheduling"

Hittade 4 uppsatser innehållade orden Dynamic job scheduling.

  1. 1. Study of an automated testing procedure with dynamic job scheduling and automatic error handling

    Uppsats för yrkesexamina på avancerad nivå, Lunds universitet/Industriell elektroteknik och automation

    Författare :Tom Andersson; [2021]
    Nyckelord :Automation; Testing; Dynamic job scheduling; Automatic error handling; Concept generation; Heuristic rules; Dispatching rules; Branch and bound; A*; Dynamic programming; Beam search; Genetic algorithms; Tabu search; Simulations; C#; Technology and Engineering;

    Sammanfattning : During the production of Axis's cameras, the optics modules have to do a number of tests and calibrations that are performed in different test stations. The test and calibration sequence differs between different models. This has so far been done manually by having operators move the units between test stations. LÄS MER

  3. 2. Dynamic Scheduling of Shared Resources using Reinforcement Learning

    Uppsats för yrkesexamina på avancerad nivå, Lunds universitet/Institutionen för reglerteknik

    Författare :Patrik Trulsson; [2021]
    Nyckelord :Technology and Engineering;

    Sammanfattning : The goal of the thesis is to simulate the Ericsson Many-Core Architecture, EMCA, and implement a dynamic scheduler for the system using reinforcement learning methods. The system contains shared resources that receive and complete jobs. Also, the deadlines and latency definitions can change depending on the job type. LÄS MER

  4. 3. Task Scheduling Using Discrete Particle Swarm Optimisation

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Hampus Karlberg; [2020]
    Nyckelord :Scheduling; Discrete Particle Swarm Optimisation; Wireless Networks; Meta Heuristic; Machine Learning; Schemaläggning; diskret Particle Swarm Optimisation; Trådlösa Nätverk; Metaheurestik; Maskininlärning;

    Sammanfattning : Optimising task allocation in networked systems helps in utilising available resources. When working with unstable and heterogeneous networks, task scheduling can be used to optimise task completion time, energy efficiency and system reliability. The dynamic nature of networks also means that the optimal schedule is subject to change over time. LÄS MER

  5. 4. Single Machine Scheduling with Tardiness Involved Objectives : A Survey

    Uppsats för yrkesexamina på grundnivå, Matematiska institutionen

    Författare :Andreas Mundt; Thomas Wich; [2007]
    Nyckelord :Single Machine; Scheduling; Tardiness; Branch and Bound; Dynamic Programming; Heuristics;

    Sammanfattning : This thesis contributes to theoretical and quantitative aspects of machine scheduling. In fact, it is dedicated to the issue of scheduling n jobs on one single machine. The scope is limited to deterministic problems - i.e. LÄS MER