We address the problem of optimally assigning spatially distributed tasks to a team of heterogeneous mobile agents in domains with inter-task temporal constraints, such as precedence constraints. Due to delay penalties, satisfying the temporal constraints impacts the overall team cost. We present a mathematical model of the problem, a benchmark anytime bounded optimal solution process, and an a...

We study the problems of non-preemptively scheduling and packing malleable and parallel tasks with precedence constraints to minimize the makespan. In the scheduling variant, we allow the free choice of processors; in packing, each task must be assigned to a contiguous subset. Malleable tasks can be processed on different numbers of processors with varying processing times, while parallel tasks...

Successive groups of golfers playing on an 18-hole golf course can be represented as a network of 18 queues in series, but the model needs to account for the fact that, on most holes, more than one group can be playing at the same time, but with precedence constraints. We show how to approximate the model of group play on each hole by a conventional G/GI/1 single-server queue, without precedenc...

— We give a new formulation for the problem oftask scheduling into unrelated processors under precedence constraints. This formulation has a polynomial number of variables and does not require that the processing times be integer valued.

Due to the precedence constraints among vertices, the partitioning problem for time-multiplexed field-programmable gate arrays (TMFPGAs) is different from the traditional one. In this paper, we first derive logic formulations for the precedence-constrained partitioning problems and then transform the formulations into integer linear programs (ILPs). The ILPs can handle the precedence constraint...

We define a timing language that supports the design and implementation of embedded control software. The language is inspired by the Logical Execution Time (LET) paradigm of Giotto, but combines it with classical precedence constraints on tasks. A program specifies multiple modes of operation, where each mode consists of a set of periodically activated sensors, actuators, tasks, and mode switc...

In this paper, we present a technique that combines motion planning and part interaction clusters to improve generation of assembly precedence constraints. In particular, this technique automatically finds, and clusters, parts that can mutually affect each other’s accessibility, and hence may impose assembly constraints. This enables generation of accurate precedence constraints without needing...

This paper presents the generalized packing server. It reduces the problem of scheduling tasks with precedence constraints on multiple processing units to the problem of scheduling independent tasks. The work generalizes our previous contribution made in the specific context of scheduling Map/Reduce workflows. The results apply to the generalized parallel task model, introduced in recent litera...

We study the problem of scheduling groups of tasks with precedence constraints on three dedicated processors. Each task requires a speci3ed set of processors. Up to three precedence constraints are considered among groups of tasks requiring the same set of processors. The objective of the problem is to 3nd a nonpreemptive schedule which minimizes the maximum completion time (makespan). This sch...

We consider the single-machine scheduling problem to minimize the weighted sum of completion times under precedence constraints. In a series of recent papers, it was established that this scheduling problem is a special case of minimum weighted vertex cover. In this paper, we show that the vertex cover graph associated with the scheduling problem is exactly the graph of incomparable pairs defin...