• No se han encontrado resultados

A GRASP algorithm to solve the problem of dependent tasks scheduling in different machines

N/A
N/A
Protected

Academic year: 2017

Share "A GRASP algorithm to solve the problem of dependent tasks scheduling in different machines"

Copied!
10
0
0

Texto completo

Loading

Figure

Fig. 1. A mathematical model for the task-scheduling problem.
Fig. 2. General structure of GRASP algorithm
Table 1. Summary table of GRASP vs. Greedy numeric experiments
Table 2. Experimental results for M = 3

Referencias

Documento similar

The agent iden- tifies those KSs, creates tasks based on them, builds pos- sible sequences of those tasks to do the work needed in front of the event, and then it must add one of

Government policy varies between nations and this guidance sets out the need for balanced decision-making about ways of working, and the ongoing safety considerations

No obstante, como esta enfermedad afecta a cada persona de manera diferente, no todas las opciones de cuidado y tratamiento pueden ser apropiadas para cada individuo.. La forma

Following this work, this thesis shows that it is possible to solve non-trivial tasks with both theoretical and practical interest (for example, the design of a curve with a

Least-Squares Support Vector Machines (LS-SVMs) have been successfully applied in many classification and regression tasks. Their main drawback is the lack of sparseness of the

show that the proposed models can outperform classical - SVR models over two real-world regression tasks, and also that problem-independent techniques applied to tackle the problem

In the present work, we try to extend those results to handwritten signatures; that is, multiple stroke tasks mod- elled with Sigma Log-Normals as presented in Sects. The

There are a lot of simulation softwares for industrial use, which can develop the processes of identification, execution and optimization of tasks in an assembly chain, design