Identical Parallel Machines
Mostrando 1-4 de 4 artigos, teses e dissertações.
-
1. Evolutionary Algorithms for Parallel Machine Scheduling Problems with Sequence Dependent Setup Times / ALGORITMOS EVOLUTIVOS PARA O PROBLEMA DE SEQÜENCIAMENTO DE TAREFAS EM MÁQUINAS PARALELAS COM TEMPOS DE PREPARAÇÃO DEPENDENTES DA SEQÜÊNCIA
Este trabalho propõe três estratégias evolutivas para resolver o problema de seqüenciamento de n tarefas em m máquinas paralelas idênticas, buscando minimizar o tempo máximo de finalização (makespan). São considerados tempos de preparação dependentes da seqüência. Os métodos propostos são comparados com outras duas heurísticas de qualidade c
Publicado em: 2004
-
2. Minimizing flowtime subject to optimal makespan on two identical parallel machines
We consider the problem of scheduling jobs on two parallel identical machines where an optimal schedule is defined as one that gives the smallest total flowtime (the sum of the completion time of all jobs) among the set of schedules with optimal makespan (the completion time of the latest job). Utilizing an existing optimization algorithm for the minimizatio
Pesquisa Operacional. Publicado em: 2000-06
-
3. Estudo de meta-heuristicas populacionais para a programação de maquinas paralelas com tempos de preparação dependentes da sequencia e datas de entrega
The application of population-based meta-heuristics on scheduling problems is studied in this work. The problem which is addressed is the minimization of total tardiness when jobs are scheduled on identical parallel machines with sequence dependent set-up times and distinct due dates. Two implementations of Genetic Algorithms and four implementations of Scat
Publicado em: 1998
-
4. Algoritmos heuristicos e exatos para resolução do problema de sequenciamento em processadores paralelos
This thesis deals with the problem of scheduling n jobs on m identical parallel machines with the objective of minimizingthe total execution time (makespan).Two cases are considered: in the first one the jobs are independent and the processing times are positive integers; in the second case we have sequence dependent times. For the first case we propose a 3-
Publicado em: 1993