Mixed-criticality scheduling to minimize makespan
, 2016 In the mixed-criticality job model, each job is characterized by two execution time parameters, representing a smaller (less conservative) estimate and a larger (more conservative) estimate on its actual, unknown, execution time. Each job is further classified as being either less critical or more critical.
Baruah, Sanjoy +2 more
openaire +3 more sources
Improved online load balancing with known makespan
43 pages, 4 ...
Böhm, Martin +4 more
openaire +4 more sources
Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model
, 2013 We consider online scheduling on multiple machines for jobs arriving one-by-one with the objective of minimizing the makespan. For any number of identical parallel or uniformly related machines, we provide a competitive-ratio approximation scheme that ...
Megow, Nicole, Wiese, Andreas
core
Santa Claus meets Makespan and Matroids: Algorithms and Reductions
ISBN:978-1-61197-791 ...
Bamas, Étienne +4 more
openaire +3 more sources
NF-MORL: a neuro-fuzzy multi-objective reinforcement learning framework for task scheduling in fog computing environments. [PDF]
Sci RepYu X +6 more
europepmc +1 more source
A novel multi-objective dynamic flexible job shop scheduling algorithm using reinforced learning based black widow spider algorithm. [PDF]
PLoS OneAkram K +6 more
europepmc +1 more source
Improved multi-strategy secretary bird optimization for efficient IoT task scheduling in fog cloud computing. [PDF]
Sci RepSangeetha K, Kanthimathi M.
europepmc +1 more source
Priority-Aware Multi-Objective Task Scheduling in Fog Computing Using Simulated Annealing. [PDF]
Sensors (Basel)Mangalampalli SS +4 more
europepmc +1 more source
Dynamic chain for scheduling of the multi-AGV systems with load-aware motion profiling. [PDF]
Sci RepNguyen TP, Nguyen H, Phan DM, Ngo HQT.
europepmc +1 more source