Results 111 to 120 of about 22,096 (146)

Distributed Integrated Scheduling Algorithm for Identical Two-Workshop Based on the Improved Bipartite Graph. [PDF]

Sensors (Basel)
Wei Y, Zhou W, Zhao J, Tan Z, Xie Z.
europepmc   +1 more source

Reinforcement learning based Secure edge enabled multi task scheduling model for internet of everything applications. [PDF]

Sci Rep
Kesavan V T, R V, Wong WK, Ng PK.
europepmc   +1 more source

Minimizing makespan for mixed batch scheduling with identical machines and unequal ready times. [PDF]

Sci Rep
Huang J.
europepmc   +1 more source

Constructive-destructive neighbor search drives artificial bee colony algorithm for variable speed green hybrid flowshop scheduling problem. [PDF]

Sci Rep
Hu D, Wu Y, Qiu L, Mi J, Yang Y.
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