Constraint-based techniques are frequently used in solving real-life scheduling problems thanks to natural modeling capabilities and strong constraint propagation techniques encoded within global constraints. In this paper we present new incremental propagation rules for shrinking time windows of activities allocated to a disjunctive resource. These rules use information about precedence constr...

The Pfair scheduling algorithms are known to be optimal for scheduling periodic real-time tasks on multiprocessor systems. However, one of the limitations of most prior work on the Pfair scheduling is that precedence constraints among tasks are not considered. We thus propose a PC-Fair (PrecedenceConstrained Fair) scheduling algorithm to overcome this limitation. The novelty of our algorithm co...

An element of the possibly unbounded core of a cooperative game with precedence constraints belongs to its bounded core if any transfer to a player from any of her subordinates results in payoffs outside the core. The bounded core is the union of all bounded faces of the core, it is nonempty if the core is nonempty, and it is a continuous correspondence on games with coinciding precedence const...

This note considers a problem of minimum length scheduling for a set of messages subject to precedence constraints for switching and communication networks. The problem was first studied by Barcaccia, Bonuccelli, and Di Iannii [1]. We consider a network with n inputs and n outputs. The messages to be sent are represented by an n × n matrix D = [di j], the traffic matrix, whose entries are nonne...

Due to the precedence constraints among vertices, the partitioning problem for dynamically reconfigurable FPGAs (DRFPGAs) 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 constraints and minimize...

This paper analyzes manufacturing feature interactions and presents algorithms for handling feature interactions in manufacturing process planning. A feature precedence network, which specifies the constraints for the machining sequence, and an AND-OR graph, which describes alternative representations, are built. Application of required/optional volumes, the AND-OR graph, and the feature preced...

Gas lift is a costly, however indispensable means to recover oil from high-depth reservoirs that entails solving the gas-lift optimization problem, GOP, often in response to variations in the dynamics of the reservoir and economic oscillations. GOP can be cast as a mixed integer nonlinear programming problem whose integer variables decide which oil wells should produce, while the continuous var...

We study two related problems in non-preemptive scheduling and packing of malleable tasks with precedence constraints to minimize the makespan. We distinguish the scheduling variant, in which we allow the free choice of processors, and the packing variant, in which a task must be assigned to a contiguous subset of processors. For precedence constraints of bounded width, we completely resolve th...

This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...

We give a (2 + ǫ)-approximation algorithm for minimizing total weighted completion time on a single machine under release time and precedence constraints. This settles a recent conjecture made in [18]