Essays about: "Multiprocessor scheduling problems"

Found 5 essays containing the words Multiprocessor scheduling problems.

  1. 1. Implementation of a Fast Approximation Algorithm for Precedence Constrained Scheduling

    University essay from Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Author : Måns Alskog; [2022]
    Keywords : Optimization; scheduling; approximation algorithms; linear programming; multiplicative weight update; Optimering; schemaläggning; approximationsalgoritmer; linjärprogrammering;

    Abstract : We present an implementation of a very recent approximation algorithm for scheduling jobs on a single machine with precedence constraints, minimising the total weighted completion time. We also evaluate the performance of this implementation. READ MORE

  3. 2. Using maximal feasible subset of constraints to accelerate a logic-based Benders decomposition scheme for a multiprocessor scheduling problem

    University essay from Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Author : Alexander Grgic; Filip Andersson; [2022]
    Keywords : logic-based Benders decomposition; maximal feasible subset of constraints; irreducible infeasible subset of constraints; multiprocessor scheduling;

    Abstract : Logic-based Benders decomposition (LBBD) is a strategy for solving discrete optimisation problems. In LBBD, the optimisation problem is divided into a master problem and a subproblem and each part is solved separately. READ MORE

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

  5. 4. Branch and Bound Algorithm for Multiprocessor Scheduling

    University essay from Datateknik

    Author : Mostafizur Rahman; [2009]
    Keywords : Multiprocessor scheduling problems; Branch and Bound; Lower Bound; Upper Bound; Task Graph Scheduling; Critical Path;

    Abstract : The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. READ MORE

  6. 5. Using ant colonies for solve the multiprocessor task graph scheduling

    University essay from Datateknik

    Author : Appah Bremang; [2006]
    Keywords : Multiprocessor scheduling problems; ant colony algorithm; ant system; pheromone trail; makespan.;

    Abstract : The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the completion time of the program has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer.In this paper, we propose an application of the Ant Colony Optimization (ACO) to a multiprocessor scheduling problem (MPSP). READ MORE