Results 11 to 20 of about 11,921 (298)
The bounded core for games with precedence constraints [PDF]
Annals of Operations Research, 2012 In this paper, the authors consider cooperative games in which there are restrictions on cooperation. These restrictions are modeled by a hierarchical structure on the set of players (cf. [\textit{U. Faigle} and \textit{W. Kern}, Int. J. Game Theory 21, No.
Grabisch, Michel, Sudhölter, Peter
openaire +7 more sources
On-Line Scheduling with Precedence Constraints
Discrete Applied Mathematics, 2000 The on-line problem of scheduling jobs with precedence constraints on \(m\) machines, is considered. The authors concentrate in two models, the model of uniformly related machines and the model of restricted assignment. For the related machines model, it is shown a lower bound of \(\Omega(\sqrt{m})\) for the competitive ratio of deterministic and ...
Yossi Azar, Leah Epstein
core +4 more sources
Periodic schedules for linear precedence constraints
Discrete Applied Mathematics, 2009 We consider the computation of periodic cyclic schedules for linear precedence constraints graphs: a linear precedence constraint is defined between two tasks and induces an infinite set of usual precedence constraints between their executions such that the difference of iterations is a linear function. The objective function is the minimization of the
Hanen, Claire, Munier-Kordon, Alix
openaire +3 more sources
INCREMENTAL FILTERING ALGORITHMS FOR PRECEDENCE AND DEPENDENCY CONSTRAINTS [PDF]
International Journal on Artificial Intelligence Tools, 2006 Precedence constraints specify that an activity must finish before another activity starts and hence such constraints play a crucial role in planning and scheduling problems. Many real-life problems also include dependency constraints expressing logical relations between the activities – for example, an activity requires presence of another activity ...
Roman Barták, Ondrej Cepek
openaire +2 more sources
Single-Machine Scheduling with Mixed Precedence Constraints
Journal of the Operations Research Society of Japan, 1999 Summary: The paper deals with a single machine scheduling problem involving a general precedence structure that permits both ordinary and fuzzy precedence constraints. Feasible schedules are evaluated not only by their cost but also by the degree of satisfaction with their precedence structure.
Levner, Eugene, Vlach, Milan
openaire +4 more sources
Precedence-constrained covering problems with multiplicity constraints
Journal of Combinatorial Optimization, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stavros G. Kolliopoulos +1 more
openaire +5 more sources
Analytic Hierarchy Process and Multilayer Network-Based Method for Assembly Line Balancing
Applied Sciences, 2020 Assembly line balancing improves the efficiency of production systems by the optimal assignment of tasks to operators. The optimisation of this assignment requires models that provide information about the activity times, constraints and costs of the ...
László Nagy +2 more
doaj +1 more source
The AllDifferent Constraint with Precedences [PDF]
, 2011 We propose AllDiffPrecedence, a new global constraint that combines together an AllDifferent constraint with precedence constraints that strictly order given pairs of variables. We identify a number of applications for this global constraint including instruction scheduling and symmetry breaking. We give an efficient propagation algorithm that enforces
Narodytska, Nina +3 more
openaire +3 more sources
Scheduling malleable tasks with precedence constraints [PDF]
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jansen, Klaus, Zhang, Hu
openaire +3 more sources
On Stochastic Scheduling with In-Tree Precedence Constraints [PDF]
SIAM Journal on Computing, 1987 The authors consider the problem of optimally scheduling a set of jobs obeying in-tree precedence constraints when a number of processors is available. It is assumed that the service times of different jobs are independent identically distributed random variables.
Christos H. Papadimitriou +1 more
openaire +1 more source