Sökning: "Schedule"

Visar resultat 21 - 25 av 312 avhandlingar innehållade ordet Schedule.

  1. 21. Decision support tools for dynamic fleet management : applications in airline planning and ambulance logistics

    Författare :Tobias Andersson; Andrew J Mason; Linköpings universitet; []
    Nyckelord :TECHNOLOGY; TEKNIKVETENSKAP;

    Sammanfattning : In this work, decision support tools for dynamic fleet management problems are developed. The operational management tasks include dispatching, supervising and sometimes reconstructing the vehicle schedule. These tasks are often complex, while the time available to complete them is short. LÄS MER

  3. 22. The flight perturbation problem : operational aircraft rescheduling

    Författare :Tobias Andersson; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : When there is a perturbation in a carefully planned flight schedule, e.g. an aircraft breakdown, it is important to minimize the negative consequences of this disturbance. In this thesis, a model and a number of solution strategies for the Flight Perturbation Problem is presented. LÄS MER

  4. 23. Integrated Code Generation

    Författare :Mattias Eriksson; Christoph Kessler; Andreas Krall; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datalogi;

    Sammanfattning : Code generation in a compiler is commonly divided into several phases: instruction selection, scheduling, register allocation, spill code generation, and, in the case of clustered architectures, cluster assignment. These phases are interdependent; for instance, a decision in the instruction selection phase affects how an operation can be scheduled. LÄS MER

  5. 24. Topics in Distributed Algorithms: On TDMA for Ad Hoc Networks and Coded Atomic Storage Algorithms

    Författare :Thomas Petig; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Fault-Tolerance; TDMA; Message Passing; Self-Stabilization; Distributed Algorithm; Wireless Networks; Time Division Multiple Access; Shared Memory; Privacy;

    Sammanfattning : Distributed algorithms run on a network of nodes. The nodes are runningconcurrently and are independent from each other. Furthermore, they have their own instructions and information. In this context, the challenges are to show thatthe algorithm is correct, regardless of computational, or communication delays. LÄS MER

  7. 25. Techniques to Tighten the Upper Bound on the ExecutionTime of Task-based Parallel Applications

    Författare :Petros Voudouris; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Scheduling; Multiprocessor; WCET; Uniform; Hard; multicore; Related; DAG; Real-Time; Dynamic; Unrelated; Makespan; Homogeneous; Parallel; Identical;

    Sammanfattning : To use multiprocessors in hard real-time systems, schedulability analysis is needed to provide formally proven guarantees for the timing behavior of the system. Programming models for parallel applications, such as OpenMP, use pragmas to specify parts of the application as parallel tasks, for example, a function or a body of a loop. LÄS MER