| Code generation methods for DSP applications are hampered by the combination of tight timing constraints imposed by the performance requirements of DSP algorithms, and resource constraints imposed by a hardware architecture. In this paper, we present a method for register binding and instruction scheduling based on the exploitation and analysis of resource-and timing constraints. The analysis...

The precedence constrained production scheduling problem is the problem of scheduling the performance of jobs over a number of scheduling periods subject to precedence constraints among the jobs. The jobs can each be performed in a number of ways, and it also needs to be determined which processing option (or options) is to be chosen for each job. There can also be arbitrary side constraints am...

The problem of minimizing the weighted sum of completion times when scheduling jobs on a single machine subject to precedence constraints is NP-hard, but can be solved in polynomial time for interesting families of constraints, such as series-parallel constraints and two-dimensional constraints. A classical decomposition theorem of Sydney leads to a simple polynomial-time algorithm for series-p...

In many task-planning domains, assemblies of autonomous agents need to construct plans and schedules for executing their assigned sets of tasks in order to complete them. Often, there will be dependencies between tasks to be executed by different agents. In such a situation, a plan-coordination problem arises when the joint plan is required to be feasible, whatever locally-feasible plans the in...