Dynamic Scheduling
Mostrando 1-12 de 43 artigos, teses e dissertações.
-
1. Scheduling optimum planting window for gladiola based on El Niño Southern Oscillation
ABSTRACT: Gladiola is an important cut flower worldwide and scheduling field gladiola production is largely dependent on planting at the correct time since its development is controlled by the air temperature. The aim of this study was to configure a planting window of gladiola in order to harvest spikes to be sold on All Souls' Day and Mother's Day holidays
Sci. agric. (Piracicaba, Braz.). Publicado em: 20/12/2019
-
2. A Prediction Model for Night Recovery of Embarked Aircrafts Based on System Dynamics
ABSTRACT: In order to make a sensible prediction on the air traffic flow management with conditions of wave-off and bolter, a system dynamic model for the night recovery operations of embarked aircrafts is built to ensure the adaption of air traffic flow with the capacity of air control at each phase of the recovery operations. The model aims at the characte
J. Aerosp. Technol. Manag.. Publicado em: 2017-12
-
3. DEVELOPMENT OF A HYBRID FUZZY GENETIC ALGORITHM MODEL FOR SOLVING TRANSPORTATION SCHEDULING PROBLEM
ABSTRACT There has been an increasing public demand for passenger rail service in the recent times leading to a strong focus on the need for effective and efficient use of resources and managing the increasing passenger requirements, service reliability and variability by the railway management. Whilst shortening the passengers’ waiting and travelling time
JISTEM J.Inf.Syst. Technol. Manag.. Publicado em: 2015-12
-
4. A hybrid method for a Project Scheduling Problem
This work deals with a project scheduling problem where the tasks consume resources to be activated, but start to produce them after that. This problem is known as Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP). Three methods were proposed to divide the problem into smaller parts and solve them separately. Each partial solution is obtained
Pesqui. Oper.. Publicado em: 08/04/2014
-
5. Programação dinâmica aplicada à otimização individualizada e desacoplada das usinas hidrelétricas de sistemas hidrotérmicos / Dynamic programming applied to individual and decoupled optimization of hydroelectric power plants on hydrothermal systems
O planejamento da operação energética de sistemas hidrotérmicos de potência tem como objetivo determinar a participação de usinas termoelétricas e hidrelétricas de forma a garantir o suprimento desta energia ao menor custo operacional possível, dentro de restrições técnicas. Alguns fatores tornam a solução desse problema bastante complexa dest
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 19/04/2012
-
6. FairCPU: Uma Arquitetura para Provisionamento de MÃquinas Virtuais Utilizando CaracterÃsticas de Processamento / FairCPU: An Architecture for Provisioning Virtual Machines Using Processing Features
Resource scheduling is a key process for cloud computing platform, which generally uses virtual machines (VMs) as scheduling units. The use of virtualization techniques provides great flexibility with the ability to instantiate multiple VMs on one physical machine (PM), migrate them between the PMs and dynamically scale VMâs resources. The techniques of con
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 02/03/2012
-
7. Heuristic solutions related to challenges of optical burst switching paradigm
Several optical network switching paradigms have been under intensive research to support rapidly increasing bandwidth requirements. Of all these paradigms, optical burst switching (OBS) is a promising switching paradigm for the next-generation Internet infrastructure. Despite the significant contributions of OBS to high speed networks such as dynamic connec
Journal of Microwaves, Optoelectronics and Electromagnetic Applications. Publicado em: 2011-12
-
8. A dynamic scheduling runtime and tuning system for heterogeneous multi and many-core desktop platforms / Um sistema de escalonamento dinâmico e tuning em tempo de execução para plataformas desktop heterogêneas de múltiplos núcleos
Atualmente, o computador pessoal (PC) moderno poder ser considerado como um cluster heterogênedo de um nodo, o qual processa simultâneamente inúmeras tarefas provenientes das aplicações. O PC pode ser composto por Unidades de Processamento (PUs) assimétricas, como a Unidade Central de Processamento (CPU), composta de múltiplos núcleos, a Unidade de P
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 2011
-
9. Algoritmos para escalonamento de tarefas dependentes representadas por grafos acíclicos direcionados em grades computacionais / Scheduling algorithms for dependent tasks represented by directed acyclic graphs on computational grids
Computational grids are potentially large distributed systems composed of heterogeneous resources connected by a network with heterogeneous links. These systems became largely used in the execution of tasks which require large processing capacities. Because they are shared systems, task submission in grids independently originate from a number of users, lead
Publicado em: 2010
-
10. Design of a passive nonlinear observer and a backstepping controller for surface vessels. / Projeto de um observador passivo não-linear e de um controlador backstepping para navios de superfície.
Dynamic Positioning Systems (DPS) are control systems used to maintain the vessel on a desired position or pre-defined path exclusively by means of active thrusters. A DPS can be separated into a set of dedicated modules with designated tasks. The most significant modules are the position and heading measurement systems, the state estimator, the controller a
Publicado em: 2010
-
11. Escalonamento on-line eficiente de programas fork-join recursivos do tipo divisão e conquista em MPI / Efficent on-line scheduling of recursive fork-join programs on MPI
Esta Dissertação de Mestrado propõe dois novos algoritmos para tornar mais eficiente o escalonamento on-line de tarefas com dependências estritas em agregados de computadores que usam como middleware para troca de mensagens alguma implementação da MPI (até a versão 2.1). Esses algoritmos foram projetados tendo-se em vista programas construídos no mo
Publicado em: 2010
-
12. Modelagem e dimensionamento do custo de migração de processos em programas MPI
A migração de processos é importante em programas MPI por vários motivos, tais como permitir re-escalonamento de processos, balanceamento de cargas e tolerância a falhas. Independentemente do tipo do uso da migração, conhecer o custo imposto pela realização desta operação é um problema pertinente. Quando utiliza-se migração para tentar diminuir
Publicado em: 2010