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 20 for “"Precedence Constraints"”.
-
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 …
-
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 …
-
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 …
-
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 …
-
Approximation algorithms for stochastic scheduling on unrelated machines
… that apply given increasingly general classes of precedence constraints on jobs. Letting n and m be, respectively, the number of jobs and machines in an instance, when jobs need an exponentially distributed amount of processing, we give: -- An O(log log min {m, n} )-approximation algorithm when …
-
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 …
-
Some combinational optimization problems on radio network communication and machine scheduling
… a set of equal processing time tasks with precedence constraints so as to minimize the makespan. It can be shown that Hu 's algorithm yields an asymptotic competitive ratio of 3/2 for intree precedence constraints and an asymptotic competitive ratio of 1 for outtree precedences, and …
-
Online optimization in routing and scheduling
… generalize these basic problems to allow for precedence constraints, capacity constraints and multiple vehicles. We give the first competitive ratio results for many new online routing problems. We then consider resource augmentation, where we give the online algorithm additional resources: …
-
Stochastic flow shop scheduling
… machines. The jobs are subjected to some intree precedence constraints. We resolve a conjecture that appeared in Pinedo and Weiss (1985) and give conditions under which the conjecture is true and give examples to prove that the conjecture is false in general.
-
Firewall Policy Optimization and Management
… consider sub-graphs of rules (inter-related by precedence constraints) and compare the advantage of placing and merging the nodes that comprise them. For policy management, a shadow detection algorithm is presented to detect anomalies.
-
Contention Bounds for Locking Computations
… problem of average response time under task precedence constraints. In addition, our analysis of worst case contention offers improved estimates for the completion time of locking computations under the execution trace model.
-
Tradeoff evaluation of scheduling algorithms for terminal-area air traffic control
… are subject to a variety of operational constraints, such as minimum separation requirements for safety, required arrival time-windows, limited deviation from a nominal or FCFS sequence, and precedence constraints on the arrival order. With these constraints, there is a range of desirable …
-
Scheduling of Wafer Test Processes in Semiconductor Manufacturing
… order on the wafer devices, resulting in precedence constraints for the schedule. Furthermore, the assignment of the wafer devices to test stations and the sequence in which they are processed affects the time required to finish the test operations, resulting in sequence dependent setup …
-
Resource Cost Aware Scheduling Problems
… generalize the problem by allowing arbitrary precedence constraints and release dates. We give approximation algorithms for minimizing an objective that is a combination of a scheduling metric, namely total weighted completion time and total weighted tardiness, and the total energy consumption …
-
Approaches for Microfluidics-Enabled, Bacterial, Single-Cell Synthetic Biology
… work concluded that there are at least three precedence constraints for Mother Machine-enhanced synthetic biology that required overcoming for the field to advance. These are (1) problems with Mother Machine geometry-based limitations of retaining and efficiently supplying nutrients to cells …
-
Tight Flow-Based Formulations for the Asymmetric Traveling Salesman Problem and Their Applications to some Scheduling Problems
… is measured by the number of variables and constraints that are used to formulate a given problem. Our formulations for the ATSP and the scheduling problems that we address are both tight and compact. We present a new class of polynomial length formulations for the asymmetric traveling …
-
Optimal control for wireless networks
… the UMW policy is derived by relaxing the precedence constraints associated with multi-hop routing and then solving a min-cost routing and max-weight scheduling problem on a virtual network of queues. When specialized to the unicast setting, unlike Backpressure, the UMW policy yields a …
-
Last-Mile Logistics - Innovative Approaches to Network Optimization and Customer Service Offerings
… Specifically, we examine the effects of (i) precedence constraints, (ii) vehicle capacity constraints, and (iii) time window constraints on local route efficiency gains due to the integration of pickup and delivery operations. Building on the extant literature on continuum approximation of …
-
Modeling and Analysis of a Feedstock Logistics Problem
… We, then, relax this assumption by providing precedence constraints on the availability of the SSLs. This precedence is defined in two different ways and, is then, effectively modeled utilizing all the formulations for the mATSP and ATSP. Given the location of a BcP for the conversion of …