Results 171 to 180 of about 14,397 (225)

Load balancing for cloud computing using optimized cluster based federated learning. [PDF]

Sci Rep
Chennam KK, V UM, Aluvalu R, Chinthaginjala R, Ab Wahab MN, Zhao X, Tolba A.   +6 more
europepmc   +1 more source

A New Framework for Job Shop Integrated Scheduling and Vehicle Path Planning Problem. [PDF]

Sensors (Basel)
Li R, Mao J, Wu X, Zhou W, Qian C, Du H.
europepmc   +1 more source

An Effective QoS-Aware Hybrid Optimization Approach for Workflow Scheduling in Cloud Computing. [PDF]

Sensors (Basel)
Cui M, Wang Y.
europepmc   +1 more source

Dynamic multi objective task scheduling in cloud computing using reinforcement learning for energy and cost optimization. [PDF]

Sci Rep
Yu X, Mi J, Tang L, Long L, Qin X.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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

No-wait flowshops with bicriteria of makespan and maximum lateness

European Journal of Operational Research, 2004
We address the m-machine no-wait flowshop scheduling problem with a weighted sum of makespan and maximum lateness criteria, known as bicriteria. The problem reduces to the single criterion of makespan or maximum lateness when a weight of zero is assigned

exaly   +2 more sources

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 Minimization with Machine Availability Constraints

Discrete Mathematics, Algorithms and Applications, 2009
We investigate the problems of scheduling n jobs to m machines with availability constraints. We consider two different models of availability constraints: the preventive model where the unavailability is due to preventive machine maintenance, and the fixed job model where the unavailability is due to a priori assignment of some of the n jobs to ...
Bin Fu, Yumei Huo, Hairong Zhao
openaire   +4 more sources

Minimizing Makespan in Batch Machine Scheduling

Algorithmica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chung Keung Poon, Pixing Zhang
openaire   +4 more sources