Initial Commit

Initial Commit

Author: mikeleo03

src/Job_Insertion+txt+Real_Time_Mesin(2).py

@@ -0,0 +1,209 @@
+# Implementasi algoritma Non-delay
+# 0.1. Impor modul eksternal
+from datetime import datetime
+import time
+import calendar
+import csv
+
+# 0.2. Definisi variabel global
+ROUTING = []
+PROCESSING_TIME = []
+MESIN = []
+JOB_DONE = []
+SCHEDULE = []
+
+# 1. Prosedur untuk melakukan pembacaan data dari file
+def read_data():
+    # Menggunakan variabel global
+    global ROUTING, PROCESSING_TIME, MESIN
+    print("Sedang membaca data...")
+
+    # Pembacaan data mesin dari file
+    # Exception handling
+    try:
+        mesin_file = open(f"test/Mesin.txt", "r")
+    except:
+        print(f"File Mesin.txt tidak ditemukan!")
+        exit()
+        
+    # Konversi ke tabel
+    mesin_data = csv.reader(mesin_file)
+    
+    # Pengolahan isi tabel
+    for row in mesin_data:
+        for i in range(len(row)):
+            row[i] = float(row[i])
+            if row[i] % 1.0 == 0:
+                row[i] = int(row[i])
+        MESIN.append(row)
+        
+    print("Data mesin berhasil dibaca!")
+    
+    # Pembacaan data job dari file      
+    n_jobs = int(input("Masukkan jumlah job: "))
+    for j in range(n_jobs):
+        # Exception handling  
+        try:
+            time_file = open(f"test/Job{j + 1}_Time.txt", "r")
+        except:
+            print(f"File Job{j + 1}_Time.txt tidak ditemukan!")
+            exit()
+            
+        # Konversi ke tabel
+        time_data = csv.reader(time_file)
+        
+        # Pengolahan isi tabel
+        for row in time_data:
+            for i in range(len(row)):
+                row[i] = float(row[i])
+                if row[i] % 1.0 == 0:
+                    row[i] = int(row[i])
+            PROCESSING_TIME.append(row)
+
+        # Exception handling 
+        try:
+            routing_file = open(f"test/Job{j + 1}_Routing.txt", "r")
+        except:
+            print(f"File Job{j + 1}_Routing.txt tidak ditemukan!")
+            exit()
+            
+        # Konversi ke tabel
+        routing_data = csv.reader(routing_file)
+        
+        # Pengolahan isi tabel
+        for row in routing_data:
+            for i in range(len(row)):
+                row[i] = float(row[i])
+                if row[i] % 1.0 == 0:
+                    row[i] = int(row[i])
+            ROUTING.append(row)
+            
+    print("Data time dan routing berhasil dibaca!")
+
+# 2. Defining ID of process
+def define_id(i, j, k):
+    ID = str(i) + str(j) + str(k)
+    return ID
+    
+# 3. Ekekusi time
+def state_check():
+    global MESIN, JOB_DONE, SCHEDULE, CJ, TJ, RJ, ST
+    print("cj",CJ)
+    print("tj",TJ)
+    print("rj",RJ)
+    print("st",ST)
+    
+    # e. Menentukan nilai cj terkecil, job dengan cj terkecil akan diproses duluan
+    min_c = min(CJ)
+    
+    # f. Kalo misal ada lebih dari 1 yang punya nilai minimum itu, kita handle
+    if CJ.count(min_c) > 1:
+        # Bikin list yang isinya semua job yang punya nilai min_c
+        index_c_in_cj = [i for i in range(len(CJ)) if CJ[i] == min_c]
+
+        # Cek nilai rj dan pilih yang mempunyai nilai rj terkecil
+        # Prioritasin yang jumlah operasinya masih banyak
+        temp_list = []  # temporary list
+        machine_list = []  # machine list
+
+        # Isi list dengan semua data yang ada di index_c_in_cj
+        for i in index_c_in_cj:
+            if len(temp_list) == 0 or ST[i][2] not in machine_list:
+                temp_list.append(ST[i])
+                machine_list.append(ST[i][2])
+            elif ST[i][2] in machine_list:
+                index_mac = machine_list.index(ST[i][2]) #i
+                if (RJ[i] < RJ[ST.index(temp_list[index_mac])]):
+                    temp_list[index_mac] = ST[i]
+                elif ST[i][1] < temp_list[index_mac][1]:
+                    temp_list[index_mac] = ST[i]
+
+        # sehkarang temp_list isinya job yang mau dijalankan
+        retval = temp_list
+
+    else:
+        retval = [ST[CJ.index(min_c)]]
+    
+    print("retval",retval)
+    # Index job value (?) 
+    for value in retval:
+        i = ST.index(value)
+        SCHEDULE.append([value[0], value[1], value[2], CJ[i], RJ[i]])
+        if value[1] == 3:
+            JOB_DONE.append([value[0], RJ[i]])
+
+    index_job = [ST.index(i) for i in retval]
+    index_mac = [i[2] - 1 for i in retval]
+    
+    print(index_job, index_mac)
+
+    COPY_OF_ST = [i for i in ST]
+    
+    bias = 0
+
+    for i, j in zip(index_job, index_mac):
+        # Updating MESIN
+        MESIN[0][j] = RJ[i]
+        try:
+            # Updating tj
+            TJ[i] = PROCESSING_TIME[ST[i][0] - 1][ST[i][1]]
+            # Updating st
+            ST[i] = [ST[i][0], ST[i][1] + 1, ROUTING[ST[i][0] - 1][ST[i][1]]]
+        except:
+            TJ.pop(i - bias)
+            ST.pop(i - bias)
+            CJ.pop(i - bias)
+            bias += 1
+            
+    # Updating cj
+    # retval = [3, 1, 3] mewakili job3, yang1, mesin3
+    CJ[retval[0][0] - 1] += RJ[retval[0][0] - 1]
+    TJ[retval[0][0] - 1] = PROCESSING_TIME[retval[0][0] - 1][ST[retval[0][0] - 1][1] - 1]
+    # ST[retval[0][0] - 1][1] += 1
+    RJ = [0 for i in range(len(ROUTING))]
+    for i in range (len(ROUTING)):
+        RJ[i] = CJ[i] + TJ[i]
+
+    return retval
+
+# Print makeform and schedule to string form in the console
+def print_schedule(schedule=SCHEDULE, lateness=None):
+    global PROCESSING_TIME
+    makespan = max(schedule, key=lambda x: x[4])[4]
+    for i in range(len(PROCESSING_TIME)):
+        j = max(filter(lambda a: a[0] == i + 1, schedule), key=lambda x: x[4])[4]
+        print(f'Job {i + 1} telah selesai dengan waktu selesai {round(j,2)}')
+        for s in sorted(schedule, key=lambda x: x[0]):
+            if s[0] == i + 1:
+                print(f'{s[0]}{s[1]}{s[2]}: Start {round(s[3],2)} End {round(s[4],2)}')
+        if lateness is not None:
+            print(f"Earliness: {round(lateness[i],2) * -1}" if lateness[i] <= 0 else f"Tardiness: {round(lateness[i],2)}")
+    print(f'---\nmakespan: {round(makespan,2)}')
+    
+read_data()
+# a. Mendefinisikan posisi melalui routing
+CJ = [MESIN[0][ROUTING[i][0] - 1] for i in range(len(ROUTING))]
+# b. Mendefinisikan waktu pemrosesan
+TJ = [PROCESSING_TIME[i][0] for i in range(len(ROUTING))]
+# c. Mendefinisikan waktu berakhir
+RJ = [0 for i in range(len(ROUTING))]
+for i in range (len(ROUTING)):
+    RJ[i] = CJ[i] + TJ[i]
+# d. Mendefinisikan id st (job, operasi, mesin)
+ST = [[i + 1, 1, ROUTING[i][0]] for i in range(len(ROUTING))]
+print("pt",PROCESSING_TIME)
+print("r",ROUTING)
+print("m",MESIN)
+# state_check()
+while state_check() != None:
+    pass
+print('---- Semua job telah selesai ----')
+# print_schedule()
+# cj, tj, rj, st = state_check()
+""" print("Hasil state check")
+print("cj", cj)
+print("tj", tj)
+print("rj", rj)
+print("st", st) """
+print(SCHEDULE)
+print(JOB_DONE)