Results 221 to 230 of about 13,809 (278)

Minimizing the makespan for a UET bipartite graph on a single processor with an integer precedence delay

, 2001
Alix Munier-Kordon
openalex   +1 more source

An improved whale optimization algorithm for flexible job shop scheduling problems with machine deterioration effects. [PDF]

Sci Rep
Li K, Tian S.
europepmc   +1 more source

A hybrid evolution strategies algorithm for non-permutation flow shop scheduling problems. [PDF]

Sci Rep
Khurshid B, Maqsood S, Habib MS, Omair M, Hwang SJ.   +4 more
europepmc   +1 more source

Genetic Algorithm Of Chu-Beasley, Hybrid Flexible Flow Shop, Production Scheduling, Makespan.

, 2016
Yesica Paola Murillo Coronel, Staci Marcela Mendez Calderon   +1 more
openalex   +1 more source

Multilevel learning aided coevolutionary particle swarm optimization algorithm for multiobjective fuzzy flexible job shop scheduling problem. [PDF]

Sci Rep
Chen J, Zhao H, Cui Z, Ma T.
europepmc   +1 more source

Job shop scheduling with sequence dependent setup times to minimize makespan

, 2003
Ju Sun, Yee -, Hark Hwang
openalex   +1 more source

DE-RALBA: dynamic enhanced resource aware load balancing algorithm for cloud computing. [PDF]

PeerJ Comput Sci
Hussain A, Aleem M, Ur Rehman A, Arshad U.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Rescheduling to minimize makespan under a limit on the makespan of the original jobs

2010 The 2nd International Conference on Computer and Automation Engineering (ICCAE), 2010
We consider the rescheduling problems arising when two agents, each with a set of nonpreemptive jobs, compete to perform their respective jobs on a common processing resource. Each agent wants to minimize a certain objective function, which depends on the completion time of its jobs only.
null Yundong Mu, null Cunchang Gu
openaire   +1 more source

Makespan-Optimal Cache Partitioning

2013 IEEE 21st International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems, 2013
In current multicore systems, cache memory is shared between multiple concurrent threads. Allocating the proper amount of cache to each thread is crucial to achieving high performance. Cache management in many existing systems is based on the least recently used replacement policy, which can lead to adverse contention between threads for shared cache ...
Pan Lai, Rui Fan
openaire   +1 more source