Buscar
Mostrando ítems 1-10 de 1917
Scheduling Grid Applications with Software Requirements
(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2011)
The aim of task scheduling is to minimize the makespan of applications, exploiting the best possible way to use shared resources. Applications have requirements which call for customized environments for their execution. ...
Knowledge representation in Industry 4.0 Scheduling problems
(Taylor & Francis Ltd, 2022-01-10)
Industry 4.0 raises the need for a closer integration of management systems in manufacturing companies. Such process is driven by Cyber-Physical Systems (CPS) and the Internet of Things (IoT). Starting from the potential ...
(Data-driven) knowledge representation in Industry 4.0 scheduling problems
(Taylor & Francis Ltd, 2022-01-10)
Industry 4.0 raises the need for a closer integration of management systems in manufacturing companies. Such process is driven by Cyber-Physical Systems (CPS) and the Internet of Things (IoT). Starting from the potential ...
A roadmap for survey designs in terrestrial acoustic monitoring
(Wiley-Blackwell, 2019-11-13)
Passive acoustic monitoring (PAM) is increasingly popular in ecological research and conservation programs, with high-volume and long-term data collection provided by automatized acoustic sensors offering unprecedented ...
A Novel Search Algorithm Based On Waterweeds Reproduction Principle For Job Shop Scheduling Problem
(Springer-Verlag London Ltd, 2016)
Multiprocessor task scheduling on heterogeneous environments by a Hybrid Chemical Reactions Optimization
(Institute of Electrical and Electronics Engineers Inc., 2017)
This work presents the modeling and implementation of a Hybrid Chemical Reactions Optimization that uses CRO operators to find good solutions, and heuristics to initialize the first population and mapping tasks in processors ...
The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
(Elsevier B.V.PE, 2021)
The best performing approximate methods proposed for the permutational flow shop scheduling problem with makespan minimization are the well known NEH constructive heuristic and the iterated greedy algorithm. Both methods ...