ok.rar_Branch and bound_flowshop_flowshop in in java_flowshop ja

package ok; import java.util.ArrayList; public class BranchAndBound { ArrayList<Tache> listeTaches; public BranchAndBound(ArrayList<Tache> listeTaches) { this.listeTaches = listeTaches; } public ArrayList<ArrayList<Noeud>> calculer() { int teta = calc_totaltime(); int profondeur = 1; int nb_taches = listeTaches.size(); Noeud racine = new Noeud(); ArrayList<ArrayList<Noeud>> solutions = new ArrayList<ArrayList<Noeud>>(); solutions.add(new ArrayList<Noeud>()); for(Tache t: listeTaches) { Noeud n = new Noeud(t); racine.AjoutFils(n,teta); solutions.get(0).add(n); } while(profondeur < nb_taches) { for(Noeud ne : CalcMin(solutions)) { ArrayList<Noeud> liste = new ArrayList<Noeud>(); for(Tache t : Divise(listeTaches, ne)) { Noeud noeud = new Noeud(t); ne.AjoutFils(noeud,teta); liste.add(noeud); } solutions.add(liste); } profondeur++; } return solutions; } public ArrayList<Tache> Divise(ArrayList<Tache> ensemble,Noeud n) { ArrayList<Tache> l = new ArrayList<Tache>(); for(Tache t : ensemble) if(!n.Contient(t)) l.add(new Tache(t)); return l; } public int calc_totaltime() { int total_time=0; for(int i=0;i<listeTaches.size();i++) { total_time+=listeTaches.get(i).gett(); } return total_time; } public ArrayList<Noeud> CalcMin(ArrayList<ArrayList<Noeud>> s) { ArrayList<Noeud> mins = new ArrayList<Noeud>(); int min = Integer.MAX_VALUE; for(ArrayList<Noeud> liste : s) { for(Noeud n : liste) { if(n.tache.bound < min) { min = n.tache.bound; mins.clear(); mins.add(n); } else if(n.tache.bound == min) mins.add(n); } } s.clear(); return mins; } }