Scheduling Algorithms
Mostrando 1-12 de 63 artigos, teses e dissertações.
-
1. Short-term mine scheduling targeting stationary grades
Abstract In short-term mine planning, mining scheduling is generally defined by designing dig-lines, allocated on benches. The mined ore will be sent to stockpiles, homogenization piles, or a concentration plant. The process to design dig-lines is usually done manually, whereby multiple simultaneous mining fronts are time-consuming and labour-intensive. The
REM - International Engineering Journal. Publicado em: 2022
-
2. Direct sequencing of blocks in stochastic models with multi-mines and multi-destinations
Abstract Mining Scheduling is the one that maximizes profit from mining over time. By means of computational methods, the deposit is discretized in blocks and algorithms are used to consummate this objective. The methods that are widely known nowadays for mining scheduling optimization of a discrete block model were based on graph theory, and among those mos
REM, Int. Eng. J.. Publicado em: 16/09/2019
-
3. Direct block scheduling technology: Analysis of Avidity
Abstract This study is focused on Direct Block Scheduling testing (Direct Multi-Period Scheduling methodology) which schedules mine production considering the correct discount factor of each mining block, resulting in the final pit. Each block is analyzed individually in order to define the best target period. This methodology presents an improvement of the
REM, Int. Eng. J.. Publicado em: 2018-03
-
4. Research and Applications of Shop Scheduling Based on Genetic Algorithms
ABSTRACT Shop Scheduling is an important factor affecting the efficiency of production, efficient scheduling method and a research and application for optimization technology play an important role for manufacturing enterprises to improve production efficiency, reduce production costs and many other aspects. Existing studies have shown that improved genetic
Braz. arch. biol. technol.. Publicado em: 20/10/2016
-
5. A multiobjective metaheuristic approach for the integrated vehicle and crew scheduling
AbstractThe integrated vehicle and crew scheduling problem is a hard Combinatorial Optimization problem widely studied over the years. Taking into consideration the range of variables related to the planning process of vehicles and drivers, there are several practical characteristics of the problem that are not reflected in the solutions generated computatio
J. Transp. Lit.. Publicado em: 2016-06
-
6. 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
-
7. JOINT OPTIMIZATION OF PRODUCTION PLANNING AND VEHICLE ROUTING PROBLEMS: A REVIEW OF EXISTING STRATEGIES
Keen competition and increasingly demanding customers have forced companies to use their resources more efficiently and to integrate production and transportation planning. In the last few years more and more researchers have also focused on this challenging problem by trying to determine the complexity of the individual problems and then developing fast and
Pesqui. Oper.. Publicado em: 2014-08
-
8. A review of three decades of research on some combinatorial optimization problems
This paper presents an overview of our research in combinatorial optimization problems. Over the last three decades, our team has been studying mostly optimization problems that arise in industrial environments through the elaboration and solution of mathematical decision models. In addition to elaborating innovative models, we have improved upon existing so
Pesqui. Oper.. Publicado em: 2013-04
-
9. Abordagens baseadas em autômatos celulares síncronos para o escalonamento estático de tarefas em multiprocessadores
O problema de escalonamento estático de tarefas computacionais (PEET) em uma arquitetura multiprocessada consiste em alocar tarefas que compõem um programa paralelo entre os nós de uma arquitetura com múltiplos processadores. Uma solução ótima de uma instância do PEET é tal que as restrições de precedência entre as tarefas sejam atendidas e o tem
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 28/02/2012
-
10. Impacto de diferentes algoritmos e geometria de depósitos minerais no planejamento de longo prazo
The main objective of mine planning is to determine ore quantity and quality distribution along a time sequence, i.e., scheduling the ore necessary to make the project technically and economic viable. These temporal sequences are fundamental for the financial success of a mine activity and presently this optimal sequence can be obtained through various minin
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 2012
-
11. Algoritmos bio-inspirados para minimização do makespan do problema de escalonamento de produção / Bio-inspired algorithms for minimizing the makespan of the production scheduling problem
Este trabalho propõe novas abordagens híbridas baseadas em técnicas da computação bio-inspirada para o problema de escalonamento do tipo Job Shop. Como o problema do tipo job shop pertence a classe NP-difícil e não existe algoritmo exato capaz de solucionar todos os tipos deste problema. Normalmente é necessária a elaboração de métodos de resolu�
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 30/09/2011
-
12. Comparative Study of Task Dependent Scheduling Algorithms to Grid Computing / Estudo comparativo de técnicas de escalonamento de tarefas dependentes para grades computacionais
À medida que a ciência avança, muitas aplicações em diferentes áreas precisam de grande poder computacional. A computação em grade é uma importante alternativa para a obtenção de alto poder de processamento, no entanto, esse alto poder computacional deve ser bem aproveitado. Mediante o uso de técnicas de escalonamento especializadas, os recursos
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 22/08/2011