Results 281 to 290 of about 3,527 (306)
Some of the next articles are maybe not open access.
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 +1 more source
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
Single-Machine Scheduling Polyhedra with Precedence Constraints
Mathematics of Operations Research, 1991We consider nonpreemptive single-machine scheduling subject to precedence constraints. We define feasible schedules by the vector of the job completion times and study the structure of the convex hull of all feasible schedules, called the scheduling polyhedron P.
Maurice Queyranne, Yaoguang Wang
openaire +2 more sources
A Stochastic Scheduling Problem with Intree Precedence Constraints
Operations Research, 1988We consider n jobs to be scheduled on two parallel machines. The jobs are subject to intree precedence constraints, that is, each job, except one which is the root of the tree, has one successor. The job of the root is at level 0 and a job is at level l if its predecessor is at level l − 1.
openaire +1 more source
A Decomposition Algorithm for Sequencing with General Precedence Constraints
Mathematics of Operations Research, 1981Many important unconstrained job sequencing problems for which optimal algorithms exist satisfy the adjacent job interchange property. In recent years, a more general property, the adjacent sequence interchange property, has been identified and shown to be a sufficient condition for the existence of efficient algorithms for sequencing problems with ...
openaire +2 more sources
A novel connector-knowledge-based approach for disassembly precedence constraint generation
International Journal of Advanced Manufacturing Technology, 2009Jingrong Li, Qing-Hui Wang
exaly