Results 251 to 260 of about 11,921 (298)

Laparoscopic vs. open inguinal hernia repair in Central Asia: a systematic review of technological readiness and safety frameworks. [PDF]

Front Surg
Akkaliyev Y, Kamaliev M, Akkaliyev M, Kokayeva E, Tsigengagel O.   +4 more
europepmc   +1 more source

ESG performance, financing constraints, and workplace health investment: evidence from Chinese biopharmaceutical enterprises. [PDF]

Front Public Health
Li A, Zhou S.
europepmc   +1 more source

The RNA-First Fallacy: Conflating Evolutionary Ancestry with Prebiotic Primacy. [PDF]

Life (Basel)
Kahana A.
europepmc   +1 more source

Perceptions and barriers to dietary fiber intake among middle-aged south Indian women: A qualitative study. [PDF]

PLOS Glob Public Health
Hebbar S, Umakanth S, Thimmappa L, M S A, Bhagavath R.   +4 more
europepmc   +1 more source

Forcing Relations for AND/OR Precedence Constraints

, 1999
A 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, Martin Skutella, Frederik Stork   +2 more
openaire   +3 more sources

Combining Tree Partitioning, Precedence, and Incomparability Constraints

Constraints, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Beldiceanu, Nicolas, Flener, Pierre, Lorca, Xavier   +2 more
openaire   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

Single-Machine Scheduling Polyhedra with Precedence Constraints

Mathematics of Operations Research, 1991
We 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
exaly   +3 more sources

Decentralized scheduling with precedence constraints

Optimization Letters, 2021
We 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