Results 121 to 130 of about 8,389 (162)
Some of the next articles are maybe not open access.
Decentralized scheduling with precedence constraints
Optimization Letters, 2021We consider decentralized scheduling with precedence constraints (DSwP) games where a set of players are scheduling jobs to complete while a set of hard precedence constraints link the jobs of the players. The impact of these decentralized scheduling efforts can be quantified by examining the price of anarchy (PoA) and the price of stability (PoS ...
Hongtan Sun, Thomas C. Sharkey
openaire +1 more source
Process Discovery under Precedence Constraints [PDF]
ACM Transactions on Knowledge Discovery from Data, 2015 Process discovery has emerged as a powerful approach to support the analysis and the design of complex processes. It consists of analyzing a set of traces registering the sequence of tasks performed along several enactments of a transactional system, in order to build a process model that can explain all the episodes recorded over them. An
Gianluigi Greco +3 more
openaire +2 more sources
Scheduling Tasks with AND/OR Precedence Constraints
SIAM Journal on Computing, 1995Summary: In traditional precedence-constrained scheduling a task is ready to execute when all its predecessors are complete. We call such a task an AND task. In this paper, we allow certain tasks to be ready when just one of their predecessors is complete. These tasks are known as OR tasks.
Donald W. Gillies, Jane W.-S. Liu
openaire +1 more source
Complexity of Scheduling under Precedence Constraints
Operations Research, 1978Precedence constraints between jobs that have to be respected in every feasible schedule generally increase the computational complexity of a scheduling problem. Occasionally, their introduction may turn a problem that is solvable within polynomial time into an NP-complete one, for which a good algorithm is highly unlikely to exist.
Jan Karel Lenstra, A. H. G. Rinnooy Kan
openaire +2 more sources
Sequencing with Series-Parallel Precedence Constraints
Mathematics of Operations Research, 1979One of the most important ideas in the theory of sequencing and scheduling is the method of adjacent pairwise job interchange. This method compares the costs of two sequences which differ only by interchanging a pair of adjacent jobs. In 1956, W. E.
Clyde L. Monma, Jeffrey B. Sidney
openaire +2 more sources
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, Manuel Iori
exaly +3 more sources
Speed Scaling of Tasks with Precedence Constraints
Theory of Computing Systems, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pruhs, K., Stee, R. van, Uthaisombut, P.
openaire +3 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é R. Correa, Andreas S. Schulz
openaire +1 more source