Results 221 to 230 of about 9,400 (263)

RETRACTED: Application of enhanced benders decomposition algorithm in circular assembly line balancing problem with task splitting.

PLoS One
Li P, Ji C.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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   +2 more sources

Machine scheduling with soft precedence constraints

European Journal of Operational Research, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
An Zhang, Xiangtong Qi
exaly   +4 more sources

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, Antonella Guzzo, Francesco Lupia, Luigi Pontieri   +3 more
openaire   +3 more sources

Scheduling Tasks with AND/OR Precedence Constraints

SIAM Journal on Computing, 1995
Summary: 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

Sequencing with Series-Parallel Precedence Constraints

Mathematics of Operations Research, 1979
One 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   +3 more sources

Complexity of Scheduling under Precedence Constraints

Operations Research, 1978
Precedence 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   +3 more sources

Speed Scaling of Tasks with Precedence Constraints

Theory of Computing Systems, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pruhs, K., Stee, R. van, Uthaisombut, P.
openaire   +5 more sources