Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 65 for “"Precedence Constraints"”.

  1. Algorithms to Schedule Tasks With And/or Precedence Constraints

    In traditional precedence-constrained scheduling a task is ready to execute when all its predecessors are completed. We call such a task an AND task. In many applications there are tasks which are ready to execute when some but not all of their predecessors are complete. We call these tasks OR …

    uiuc Repository record for Algorithms to Schedule Tasks With And/or Precedence Constraints (opens in a new tab)

  2. Scheduling tasks with precedence constraints on heterogeneous distributed computing systems

    … computing systems. Scheduling tasks with precedence constraints is a well studied problem and a number of heuristics have been proposed.</p> <p>In this thesis, we first consider the problem of scheduling task graphs in heterogeneous distributed computing systems (HDCS) where the processors …

    utk-theses Repository record for Scheduling tasks with precedence constraints on heterogeneous distributed computing systems (opens in a new tab)

  3. Energy-Aware Task Scheduling with Conditional Precedence Constraints on MPSoCs

    … and at the same time guarantee the timing constraints. In this thesis, we focus on three distinct problems in the domain of energy-aware scheduling of tasks with conditional precedence and timing constraints on MPSoCs (Multiprocessor System on- Chips). The first problem focuses on …

    unsw Repository record for Energy-Aware Task Scheduling with Conditional Precedence Constraints on MPSoCs (opens in a new tab)

  4. Genetic algorithm for process sequencing modelled as the travelling salesman problem with precedence constraints

    … thesis addresses process sequencing subject to precedence constraints which arises as a subproblem in scheduling, planning and routing problems. The process sequencing problem can be modelled as the Travelling Salesman Problem with Precedence Constraints (TSPPC). In the general Travelling …

    dcu Download PDF for Genetic algorithm for process sequencing modelled as the travelling salesman problem with precedence constraints (opens in a new tab)

  5. Decentralized Allocation of Tasks with Temporal and Precedence Constraints to a Team of Robots

    … task allocation problems where tasks have constraints on where, when and in which order they should be performed have received limited attention, especially in decentralized settings where multiple decision makers are allowed. Here, we investigate multi-robot task allocation problems with …

    umn Repository record for Decentralized Allocation of Tasks with Temporal and Precedence Constraints to a Team of Robots (opens in a new tab)

  6. Static-task scheduling incorporating precedence constraints and deadlines in a heterogeneous-computing environment / Michael D Niedert

    … scheduling problem with deadline and dependency constraints. Tradeoffs of speed and schedule quality were noted between the algorithms. The greedy algorithm produced results quicker than the A* and simulated annealing algorithms, but with a lower schedule quality. Because of these offsetting …

    nps Repository record for Static-task scheduling incorporating precedence constraints and deadlines in a heterogeneous-computing environment / Michael D Niedert (opens in a new tab)

  7. Static scheduler for hard real-time tasks on multiprocessor systems

    … that ensures tasks meet their deadlines and precedence constraints. Given a set of hard real-time tasks, to determine whether a feasible schedule exists such that the timing constraints and precedence constraints of the tasks are satisfied, and to produce such a schedule if one exists are the …

    nps Repository record for Static scheduler for hard real-time tasks on multiprocessor systems (opens in a new tab)

  8. Task Graph Performance Bounds Through Comparison Methods

    … its execution time will usually also increase as precedence constraints are added to ensure series-parallel structure. Bounding the slowdown ratio would allow an informed tradeoff between the benefits of a restrictive formalism and its cost in loss of performance.This dissertation deals with …

    oxford Restricted access

  9. A Simulation Analysis of Constrained Rate and Line Assembly Processes

    … the performance of a system with zone capacity constraints, operator constraints, and precedence constraints in an assembly line using takt analysis. A small-scale model of an aircraft assembly line is built in Simio and precedence constraints are modified in independent simulations. The primary …

    tamu Repository record for A Simulation Analysis of Constrained Rate and Line Assembly Processes (opens in a new tab)

  10. Evaluations of some scheduling algorithms for hard real-time systems

    … of the ESS which extracts critical timing constraints and precedence constraints for operators and schedules the time-critical operators to guarantee that their timing constraints will be met. The Static Scheduler uses the information of timing constraints and precedence constraints to …

    nps Repository record for Evaluations of some scheduling algorithms for hard real-time systems (opens in a new tab)

  11. Some topics on deterministic scheduling problems

    … the scheduling of a set of ri tasks, with precedence constraints, on m >= 1 identical and parallel processors so as to minimize the makespan. Specifically, it considers the situation where tasks, along with their precedence constraints, are released at different times, and the scheduler has …

    njit Repository record for Some topics on deterministic scheduling problems (opens in a new tab)

  12. Algoritmai realaus laiko bendrakeleivio paieškos sistemoms /

    … focusing on exact shortest-path search with precedence constraints and dynamic driver-rider matching under dynamically changing environment conditions. For route planning, an adapted Held-Karp dynamic programming algorithm, tailored to precedence constraints, was proposed, achieving over 100 …

    vilnius Repository record for Algoritmai realaus laiko bendrakeleivio paieškos sistemoms / (opens in a new tab)

  13. Data-Aware Scheduling in Datacenters

    … "In what order should one process jobs?'' Often, precedence constraints specify a partial order over the set of jobs and the objective is to find suitable schedules that satisfy the partial order. However, in the presence of hard deadline constraints, it may be impossible to find a schedule that …

    maryland Repository record for Data-Aware Scheduling in Datacenters (opens in a new tab)

  14. Using integer programming for strategic underground and open pit-to-underground scheduling

    … a coarse time fidelity and relies on a set of constraints that forces specific pairs of mining activities to be completed in different time periods. By pairing this novel formulation with recently developed linear programming algorithms and heuristics, we show a dramatic decrease in solution …

    colo-mines Repository record for Using integer programming for strategic underground and open pit-to-underground scheduling (opens in a new tab)

  15. Task scheduling in supercapacitor based environmentally powered wireless sensor nodes

    … to schedule nonpreemptable tasks without precedence constraints. Finally, the modified first in first out (MFIFO) algorithm is proposed to schedule nonpreemptable tasks with precedence constraints. The MEDF and MFIFO algorithms take into account energy constraints of tasks in addition to …

    gatech Repository record for Task scheduling in supercapacitor based environmentally powered wireless sensor nodes (opens in a new tab)

  16. Design for Assembly Line Performance: The Link Between DFA Metrics and Assembly Line Performance Metrics

    … maintaining the production rate (takt time) and precedence constraints. The precedence constraints are systematically relaxed in order to generate measures on a component-by- component basis as to the impact it could have on reducing cycle time and improving Line Balancing performance. These …

    rit Repository record for Design for Assembly Line Performance: The Link Between DFA Metrics and Assembly Line Performance Metrics (opens in a new tab)

  17. Supporting Distributed Fault Tolerance In A Real-Time Micro-Kernel

    … scheduling for hard real-time tasks with task precedence constraints is an NP-hard problem. The new system is based on an off-line fault-tolerant scheduling strategy that generates a static schedule of tasks for each processing unit to follow. This algorithm handles both the task precedence …

    vt Repository record for Supporting Distributed Fault Tolerance In A Real-Time Micro-Kernel (opens in a new tab)

  18. A Petri net formulation for the general scheduling problem

    … Graham Algorithm A and a random list for fifteen precedence constraints. The proposed heuristic generated a better schedule in 98 of 160 cases tested for the 15 precedence constraints. The proposed heuristic generated a schedule as good as the schedule which is generated by any other list in a …

    ubc Repository record for A Petri net formulation for the general scheduling problem (opens in a new tab) Download PDF for A Petri net formulation for the general scheduling problem (opens in a new tab)

  19. Genetic algorithm for batch sequencing

    … times. The TSP framework may consist of precedence constraints, reflecting that certain batch must be inserted before others. TSP has a starting node (location) which is a home location. In this thesis, we do not account for precedence constraints in order to get a least cost sequence. In …

    missouri Repository record for Genetic algorithm for batch sequencing (opens in a new tab)

  20. Optimization-based decomposition heuristic for solving complex underground mine scheduling problems, An

    … net present value; two principal types of constraints exist: (i) resource constraints, which limit the number of activities committed to a time period based on the availability of a given supply and on the amount of that supply required to perform the activity, and (ii) precedence …

    colo-mines Repository record for Optimization-based decomposition heuristic for solving complex underground mine scheduling problems, An (opens in a new tab)

Page 1 of 4