Results 271 to 280 of about 11,921 (298)

The Travelling Salesman Problem with Precedence Constraints

OPSEARCH, 2001
The 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, Pandit, S. N. Narahari   +1 more
openaire   +2 more sources

The parallel complexity of scheduling with precedence constraints

Journal of Parallel and Distributed Computing, 1986
We 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, Eli Upfal, Manfred K. Warmuth   +2 more
openaire   +1 more source

Process Discovery via Precedence Constraints

2012
A 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, Antonella Guzzo, Luigi Pontieri   +2 more
openaire   +1 more source

Vertex Ordering with Precedence Constraints

2023
Jeff Kinne, Akbar Rafiey, Arash Rafiey, Mohammad Sorkhpar   +3 more
openaire   +1 more source

A Stochastic Scheduling Problem with Intree Precedence Constraints

Operations Research, 1988
We 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, 1981
Many 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

Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints

Computers and Operations Research, 2021
Huali Fan, Hegen Xiong, Mark Goh
exaly  

Preemptive scheduling on unrelated machines with fractional precedence constraints

Journal of Parallel and Distributed Computing, 2021
Vaneet Aggarwal, Tian Lan
exaly  

Precedence Constraints and Arrow Diagrams

SIAM Review, 1967
openaire   +1 more source

Two-machine flow shop scheduling with deteriorating jobs and chain precedence constraints

International Journal of Production Economics, 2012
Chuanli Zhao, Hengyong Tang
exaly