public void Algoritm_1()
{
int buff, buff2;
for (int i = 0; i < groups.Nz1.Count; i++)
{
for (int j = 0; j < groups.Nz1[i].Count; j++)
{
for (int k = 0; k < groups.Nz1[i][j].Count; k++)
{
for (int l = 0; l < Q.Nz1[0].Count; l++)
{
for (int t = 0; t < Q.Nz1[0][l].Count; t++)
{
this.shedule = new Shedule(this.BuildR(groups.Nz1[i]), countL);
this.shedule.ConstructShedule();
buff2 = shedule.GetTime();
buff = groups.Nz1[i][j][k];
groups.Nz1[i][l][k] = Q.Nz1[0][l][t];
this.shedule = new Shedule(this.BuildR(groups.Nz1[i]), countL);
this.shedule.ConstructShedule();
if (shedule.GetTime() > buff2)
{
groups.Nz1[i][j][k] = buff;
}
}
}
}
}
}
Algoritm_3();
}
public void Algoritm_3()
{
int buff = 0;
for (int k = 0; k < groups.Nz1.Count(); k++)
{
for (int i = 0; i < Q.Nz1[0].Count(); i++)
{
for (int j = 0; j < Q.Nz1[0][i].Count(); j++)
{
groups.Nz1[k][i].Add(Q.Nz1[0][i][j]);
this.shedule = new Shedule(this.BuildR(groups.Nz1[k]), countL);
this.shedule.ConstructShedule();
if (shedule.GetTime() > Tz)
{
groups.Nz1[k][i].RemoveAt(groups.Nz1[k][i].Count - 1);
}
else
{
Q.Nz1[0][i].RemoveAt(j);
}
}
}
}
for (int k = 0; k < groups.Nz1.Count(); k++)
{
this.shedule = new Shedule(this.BuildR(groups.Nz1[k]), countL);
this.shedule.ConstructShedule();
Prostoi[k] = Tz - shedule.GetTime();
//MessageBox.Show(Convert.ToString(Tz - shedule.GetTime()));
}
}
public void Algoritm_3()
{
for (int k = 0; k < groups.Nz1.Count(); k++)
{
for (int i = 0; i < Q.Nz1[0].Count(); i++)
{
for (int j = 0; j < Q.Nz1[0][i].Count(); j++)
{
groups.Nz1[k][i].Add(Q.Nz1[0][i][j]);
this.shedule = new Shedule(this.BuildR(groups.Nz1[k]), countL);
this.shedule.ConstructShedule();
if (shedule.GetTime() > Tz)
{
groups.Nz1[k][i].Remove(Q.Nz1[0][i][j]);
}
else
{
Q.Nz1[0][i].Remove(Q.Nz1[0][i][j]);
}
}
}
}
}