Results 231 to 240 of about 9,400 (263)
Some of the next articles are maybe not open access.
Forcing Relations for AND/OR Precedence Constraints
1999A natural generalization of ordinary precedence constraints are so-called AND/ OR precedence constraints. In an AND constraint, a job must wait for all its predecessors while in an OR constraint, a job has to wait for at least one of its predecessors.
Rolf H. Möhring +2 more
openaire +2 more sources
The Bin Packing Problem with Precedence Constraints
Operations Research, 2012Given a set of identical capacitated bins, a set of weighted items, and a set of precedences among such items, we are interested in determining the minimum number of bins that can accommodate all items and can be ordered in such a way that all precedences are satisfied. The problem, denoted as the bin packing problem with precedence constraints (BPP-P)
Mauro Dell'Amico +2 more
exaly +4 more sources
Single Machine Scheduling with Precedence Constraints
Mathematics of Operations Research, 2004We discuss the problem of sequencing precedence-constrained jobs on a single machine to minimize the average weighted completion time. This problem has attracted much attention in the mathematical programming community since Sidney’s pioneering work in 1975 (Sidney, J. B. 1975.
José Correa, Andreas S. Schulz
openaire +1 more source
Uniprocessor Scheduling Under Precedence Constraints
12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06), 2006In this paper we present a novel approach to the constrained scheduling problem, while addressing a more general class of constraints that arise from the timing requirements on real-time embedded controllers and from the implementation of mixed data-flow/event-driven real-time systems.
Leonardo Mangeruca +2 more
openaire +1 more source
The parallel complexity of scheduling with precedence constraints
Journal of Parallel and Distributed Computing, 1986We study the problem of parallel computation of a schedule for a system of n unit-length tasks on m identical machines, when the tasks are related by a set of precedence constraints. We present NC algorithms for computing an optimal schedule in the case where m, the number of available machines, does not vary with time and the precedence constraints ...
Danny Dolev +2 more
openaire +2 more sources
Scheduling of tasks with effectiveness precedence constraints
Optimization Letters, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emily A. Heath +2 more
openaire +2 more sources
The Travelling Salesman Problem with Precedence Constraints
OPSEARCH, 2001The Travelling Salesman Problem with Precedence Constraints (TSP-PC) is the usual Travelling Salesman Problem with the restrictions that the salesman should start from a prescribed node (i.e., a headquarters) and each admissible tour is to satisfy k precedence relations denoted by ir < jr; r=1,2,...,k.
Ahmed, Zakir Hussain +1 more
openaire +2 more sources
Process Discovery via Precedence Constraints
2012A key task in process mining consists of building a graph of causal dependencies over process activities, which can then be used to derive more expressive models in some high-level modeling language. An approach to accomplish this task is presented where the learning process can exploit the background knowledge that, in many cases, is available to the ...
Gianluigi Greco +2 more
openaire +1 more source
Combining Tree Partitioning, Precedence, and Incomparability Constraints
Constraints, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Beldiceanu, Nicolas +2 more
openaire +5 more sources