Results 161 to 170 of about 23,190 (193)

Dynamic multi-criteria scheduling algorithm for smart home tasks in fog-cloud IoT systems. [PDF]

Sci Rep
Bhakhar R, Chhillar RS.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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 ...
Fu, Bin, Huo, Yumei, Zhao, Hairong
openaire   +2 more sources

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

Minimizing Makespan in Batch Machine Scheduling

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

Concurrent flowshop scheduling to minimize makespan

European Journal of Operational Research, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koulamas, Christos, Kyparisis, George J.
openaire   +1 more source

Makespan minimization form parallel identical processors

Naval Research Logistics, 1995
Summary: We introduce an algorithm, called TMO (Two-Machine Optimal Scheduling) which minimizes the makespan for two identical processors. TMO employs lexicographic search in conjunction with the longest-processing time sequence to derive an optimal schedule.
Ho, Johnny C., Wong, Johnny S.
openaire   +2 more sources

Online List Scheduling for Makespan Minimization

ACM SIGACT News, 2022
In the modern interactive computing era, computational problems such as scheduling, rout- ing, sequencing, and resource management are online in nature. In the online framework, at the outset, an algorithm receives and processes inputs one by one in order without the knowledge of future inputs, unlike in an offline framework, where an algorithm knows ...
Debasis Dwibedy, Rakesh Mohanty
openaire   +1 more source

Minimizing makespan in parallel flowshops

Journal of the Operational Research Society, 1997
Summary: In this study, a new class of proportional parallel flow shop problems with the objective of minimizing the makespan has been addressed. A special case for this problem in which jobs are processed on only one machine as opposed to two or more machines in a flow shop, is the well-known multiple processor problem which is NP-complete.
Sundararaghavan, P. S., Kunnathur, A. S., Viswanathan, I.   +2 more
openaire   +2 more sources

Supply Chain Scheduling: Makespan reduction potential

International Journal of Logistics Research and Applications, 2012
Specialization, concentration on core competencies, and increasing globalization lead to a situation where competition between big national companies is increasingly replaced by competition between globally operating supply chains (Christopher, 1992; Cooper et al., 1997; Handfield and Nichols, 1999; Barnes, 2006; Vandaele et al., 2007; Stadtler, 2008).
openaire   +1 more source