def afficher(self):
res = "Ordre des jobs : "
for job in self.seq:
res += "{} ".format(job.numero())
res += "\n"
for job in self.seq:
res += "Job {} : ".format(job.numero())
for mach in range(self.nb_machines):
res += "op {} à t = {} | ".format(mach, self.date_debut_operation(job, mach))
res += "\n"
res += "Cmax = {}".format(self.dur)
return res
def afficher(self):
print("Ordre des jobs :", end='')
for job in self.seq:
print(" ", job.numero(), " ", end='')
print()
for job in self.seq:
print("Job", job.numero(), ":", end='')
for mach in range(self.nb_machines):
print(" op",
mach,
"à t =",
self.date_debut_operation(job, mach),
"|",
end='')
print()
print("Durée ordo =", self.dur)
def to_index(self):
L = []
for job in self.seq:
L.append(job.numero())
return L
def generation_Heuristique(mon_fichier_txt):
flow_shop = flowshop.Flowshop()
ordo = flow_shop.definir_par(
mon_fichier_txt) # Construction d'un probleme avec un fichier .txt
nb_machines = ordo.nb_machines
liste_job = ordo.seq
nbr_Jobs = len(liste_job)
t = []
for job in liste_job:
t.append(job.duree_op)
palmIndex = [0 for i in range(nbr_Jobs)
] #index de pente de Palmer de chaque tache
for i in range(nbr_Jobs):
sum = 0
for j in range(nb_machines):
sum = sum + (nb_machines - 2 * j + 1) * t[i][j]
palmIndex[i] = sum
johnIndex = [0 for i in range(nbr_Jobs)
] #index de pente de Johnson de chaque tache
for i in range(nbr_Jobs):
mi = 10000
for j in range(nb_machines - 1):
if t[i][j] + t[i][j + 1] < mi:
mi = t[i][j] + t[i][j + 1]
signe = 1
if (t[i][1] - t[i][nb_machines - 1]) < 0:
signe = -1
johnIndex[i] = palmIndex[i] - signe / mi
palmerSol = [0] #Solution basee sur indice de Palmer
johnsonSol = [0] #Solution basee sur indice de Johnson
for k in range(1, nbr_Jobs):
ind = 0
while (ind < len(palmerSol)
and palmIndex[palmerSol[ind]] < palmIndex[k]):
ind += 1
palmerSol.insert(ind, k)
for n in range(1, nbr_Jobs):
ind2 = 0
while (ind2 < len(johnsonSol)
and johnIndex[johnsonSol[ind2]] < johnIndex[k]):
ind2 += 1
johnsonSol.insert(ind2, n)
liste_job_palmer = [None for i in range(0, nbr_Jobs)]
liste_job_johnson = [None for i in range(0, nbr_Jobs)]
for job in liste_job: # prob job potentiel manquant dans les deux listes
for i in range(0, nbr_Jobs):
if job.numero() == palmerSol[i]:
liste_job_palmer[i] = job
if job.numero() == johnsonSol[i]:
liste_job_johnson[i] = job
ordo_palmer = ordonnancement.Ordonnancement(
nb_machines) # Création d'un nouvel ordonnancement
ordo_palmer.ordonnancer_liste_job(liste_job_palmer)
ordo_johnson = ordonnancement.Ordonnancement(
nb_machines) # Création d'un nouvel ordonnancement
ordo_johnson.ordonnancer_liste_job(liste_job_johnson)
return (palmerSol, johnsonSol, ordo_palmer, ordo_johnson)