def schargepmtn_nlogn(jobs_list):
R = HeapMin()
Q = HeapMax()
i=0
for job in jobs_list:
R.add(Cell(value=job.head[0], job=i))
i += 1
# S = np.zeros(len(jobs_list)) # momenty rozpoczęcia wykonywania zadań
# C = np.zeros(len(jobs_list)) # momenty zakończenia wykonywania zadań
Nn = list(range(len(jobs_list)))
Ng = []
# order = []
# Algorymt
t = 0
l = 0
Cmax = 0
while len(Nn) > 0 or len(Ng) > 0:
while len(Nn) > 0 and R.min().value <= t:
j = R.min(True).job
Nn.remove(j)
Ng.append(j)
Q.add(Cell(value=jobs_list[j].tail[0], job=j))
if jobs_list[j].tail[0] > jobs_list[l].tail[0]:
jobs_list[l].body[0] = t - jobs_list[j].head[0]
t = jobs_list[j].head[0]
if jobs_list[l].body[0] > 0:
Ng.append(l)
Q.add(Cell(value=jobs_list[l].tail[0], job=l))
if len(Ng) == 0:
t = R.min().value
else:
j = Q.max(True).job
Ng.remove(j)
l = j
t = t + jobs_list[j].body[0]
Cmax = max(Cmax, t + jobs_list[j].tail[0])
return Cmax
def schrange_nlogn(jobs_list):
'''
Simulate RPQ problem
:param jobs_list:
:param order:
:return:
'''
R = HeapMin()
Q = HeapMax()
i=0
for job in jobs_list:
R.add(Cell(value=job.head[0], job=i))
i += 1
S = np.zeros(len(jobs_list)) # momenty rozpoczęcia wykonywania zadań
C = np.zeros(len(jobs_list)) # momenty zakończenia wykonywania zadań
Nn = list(range(len(jobs_list)))
Ng = []
order = []
# Algorymt
t = R.min().value
while len(Nn) > 0 or len(Ng) > 0:
while len(Nn) > 0 and R.min().value <= t:
j = R.min(True).job
Nn.remove(j)
Ng.append(j)
Q.add(Cell(value=jobs_list[j].tail[0], job=j))
if len(Ng) == 0:
t = R.min().value
else:
j = Q.max(True).job
Ng.remove(j)
order.append(j)
t += jobs_list[j].body[0]
# S czas rozpoczecia zadania
first = True
for i in order:
if first:
S[i] = jobs_list[i].head[0]
i_last = i
first = False
else:
S[i] = max(jobs_list[i].head[0], S[i_last]+jobs_list[i_last].body[0])
i_last = i
# C czas zakonczenia zadania
for i in order:
C[i] = S[i] + jobs_list[i].body[0]
# Obliczenie cmax
cmax = []
for i in order:
cmax.append(C[i]+jobs_list[i].tail[0])
# Najdłuższy czas jako ostatnie zakonczone zadania
cmax = max(cmax)
return order, cmax