Sökning: "Parallel Identical Machines"

Hittade 4 uppsatser innehållade orden Parallel Identical Machines.

  1. 1. GPU-Assisted Collision Avoidance for Trajectory Optimization : Parallelization of Lookup Table Computations for Robotic Motion Planners Based on Optimal Control

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

    Författare :Abhiraj Bishnoi; [2021]
    Nyckelord :Motion Planning; Robotics; Trajectory Optimization; GPGPU; Parallel Programming;

    Sammanfattning : One of the biggest challenges associated with optimization based methods forrobotic motion planning is their extreme sensitivity to a good initial guess,especially in the presence of local minima in the cost function landscape.Additional challenges may also arise due to operational constraints, robotcontrollers sometimes have very little time to plan a trajectory to perform adesired function. LÄS MER

  3. 2. Lot-sizing and scheduling optimization using genetic algorithm

    Magister-uppsats, Högskolan i Skövde/Institutionen för ingenjörsvetenskap

    Författare :Mohammed Darwish; [2019]
    Nyckelord :Capacitated lot-sizing and scheduling problem; Real-Coded Genetic Algorithm; Backlogging; Sequence-dependent setups; Non-identical parallel machines;

    Sammanfattning : Simultaneous lot-sizing and scheduling problem is the problem to decide what products to be produced on which machine and in which order, as well as the quantity of each product. Problems of this type are hard to solve. LÄS MER

  4. 3. A column generation approach to scheduling of parallel identical machines

    Master-uppsats, Linköpings universitet/Matematiska institutionen

    Författare :Julia Jobson; [2019]
    Nyckelord :Scheduling; Parallel Identical Machines; Column Generation; Large Neighbourhood Search; Mixed Integer Programming; GCG;

    Sammanfattning : This thesis aims to implement a combination of Linear Programming Column Generation and a Large Neighbourhood Search heuristic to solve scheduling problems. The resulting method is named Integer Programming Column Search (IPCS). LÄS MER

  5. 4. A Bicriteria Simulated Annealing Algorithm for Scheduling Jobs on Parallel Machines with Sequence Dependent Setup Times

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

    Författare :Rasmus Persson; [2008]
    Nyckelord :Technology and Engineering;

    Sammanfattning : The study considers the scheduling problem of identical parallel machines subject to minimization of the maximum completion time and the maximum tardiness expressed in a linear convex objective function. The maximum completion time or makespan is the date when the last job to be completed leaves the system. LÄS MER