Results 131 to 140 of about 8,389 (162)
Some of the next articles are maybe not open access.
Machine scheduling with soft precedence constraints
European Journal of Operational Research, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
An Zhang 0001, Xiangtong Qi, Guanhua Li
openaire +3 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 +1 more source
A monotone approximation algorithm for scheduling with precedence constraints [PDF]
Operations Research Letters, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rob Van Stee +2 more
exaly +5 more sources
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.
Yaoguang Wang
exaly +3 more sources
Stochastic Machine Scheduling with Precedence Constraints [PDF]
SIAM Journal on Computing, 2005 We consider parallel, identical machine scheduling problems where the jobs are subject to precedence constraints, release dates, and the processing times of jobs are governed by independent probability distributions. The objective is to minimize the expected value of the total weighted completion time `&; w_j C_j, where w_jgeq 0`.
Martin Skutella, Marc Uetz
exaly +6 more sources
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 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
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
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 +4 more sources