?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=EVALUASI+KINERJA+GENETIC+ALGORITM+(GA)+UNTUK%0D%0APENYELESAIAN+PERSOALAN+JOB+SHOP+SCHEDULLING%0D%0APROBLEM+(JSSP)&rft.creator=Ade+Pamungkas%2C+1117032001&rft.subject=+&rft.subject=QA76+Computer+software&rft.description=Job-Shop+Scheduling+Problem+(JSSP)+dikenal+sebagai+salah+satu+masalah+optimasi%0D%0Akombinatorial+yang+banyak+dipelajari.+Ada+beberapa+literatur+yang+melaporkan+cara%0D%0Auntuk+menyelesaikan+pemasalahan+ini%2C+namun+sepengetahuan+kami%2C+belum+ada%0D%0Aalgoritma+solusi+yang+efisien+yang+telah+ditemukan+untuk+menyelesaikannya%0D%0Adengan+optimalisasi+pada+waktu+polinomial.+Hal+ini+menyebabkan+banyak%0D%0Aketertarikan+pada+penggunaan+metode+metaheuristik+untuk+mengatasi+masalah%0D%0Atersebut.+Bagaimana+mengembangkan+metode+metaheuristik+yang+efisien+untuk%0D%0Amenyelesaikan+persoalan+JSSP+masih+manjadi+suatu+tantangan.%0D%0ASelama+dekade+terakhir%2C+Genetic+Algorithm+(GA)+telah+menjadi+salah+satu+metode%0D%0Ametaheuristik+populer+untuk+menyelesaikan+berbagai+masalah+kombinatorial+yang%0D%0Asulit.+Banyak+upaya+telah+dilakukan+untuk+memberikan+implementasi+GA+yang%0D%0Aefisien.+Tujuan+penelitian+ini+adalah+untuk+memberikan+laporan+evaluasi+kinerja%0D%0Adengan+pendekatan+GA+untuk+menyelesaikan+JSSP.%0D%0AEfektivitas+kinerja+GA+diukur+dengan+menyelesaikan+43+benchmark+test+problem%0D%0Ayang+terdiri+dari+3+instance+dari+Fisher+dan+Thompson%2C+(1963)+dan+40+instance+dari%0D%0ALawrence%2C+(1984).+Hasil+komputasi+menunjukan+bahwa+GA+mampu+menyelesaikan%0D%0A27+test+problem+dengan+optimal+dan+dari+43+test+problem+yang+diujikan+menunjukan%0D%0Abahwa+nilai+rata+rata+relatif+error+yang+dicapai+hanya+1%2C14%25.+Hasil+eksperimen+ini%0D%0Amemvalidasi+bahwa+GA+efektif+untuk+menemukan+solusi+JSSP.%0D%0AKata+Kunci%3A+Genetic+algorithms%3B+Scheduling%2C+Job-shop+scheduling%3B+Optimization%0D%0Aproblem%0D%0A%0D%0A%0D%0A%0D%0Aabstract%0D%0A%0D%0AJob-Shop+Scheduling+Problem+(JSSP)+is+known+as+one+of+extensively+studied%0D%0Acombinatorial+optimization+problems.+There+have+been+many+papers+reported+the%0D%0Away+for+solving+this+problem%2C+but+to+our+knowledge+there+is+no+efficient+solution%0D%0Aalgorithm+has+been+found+yet+for+solving+it+to+optimality+in+polynomial+time.+This%0D%0Ahas+led+to+many+interests+in+using+metaheuristic+methods+to+solve+the+problem.+How%0D%0Ato+develop+an+efficient+metaheuristic+method+to+solve+job+scheduling+problems+is%0D%0Astill+challenging+but+frustrating.%0D%0ADuring+the+past+decade%2C+Genetic+Algorithm+(GA)+has+been+one+of+popular%0D%0Ametaheuristic+methods+for+solving+various+difficult+combinatorial+problems.+Many%0D%0Aefforts+have+been+made+in+order+to+give+an+efficient+implementation+of+GA.+The%0D%0Apurpose+of+this+research+is+to+give+a+reports+on+performance+evaluation+of+GA%0D%0Aapproaches+in+job-shop+scheduling+practices.%0D%0AThe+effectiveness+of+GA+performance+is+measured+by+solving+43+benchmark+test%0D%0Aproblems+consisting+of+3+instances+of+Fisher+and+Thompson%2C+(1963)+and+40%0D%0Ainstances+of+Lawrence%2C+(1984).+Computation+results+show+that+GA+is+able+to+solve%0D%0A27+test+problems+with+optimal+and+of+43+test+problems+tested+showed+that+the%0D%0Aaverage+value+of+the+relative+error+achieved+only+1.14%25.+The+results+of+this%0D%0Aexperiment+validate+that+GA+is+effective+for+finding+JSSP+solutions.%0D%0AKeywords+%3A+Genetic+algorithms%3B+Scheduling%2C+Job-shop+scheduling%2C+Optimization%0D%0Aproblem&rft.publisher=UNIVERSITAS+LAMPUNG&rft.date=2018-01-23&rft.type=Skripsi&rft.type=NonPeerReviewed&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F30389%2F1%2FABSTRAK.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F30389%2F3%2FSKRIPSI%2520FULL.pdf&rft.format=text&rft.identifier=http%3A%2F%2Fdigilib.unila.ac.id%2F30389%2F2%2FSKRIPSI%2520TANPA%2520BAB%2520PEMBAHASAN.pdf&rft.identifier=++Ade+Pamungkas%2C+1117032001++(2018)+EVALUASI+KINERJA+GENETIC+ALGORITM+(GA)+UNTUK+PENYELESAIAN+PERSOALAN+JOB+SHOP+SCHEDULLING+PROBLEM+(JSSP).++UNIVERSITAS+LAMPUNG%2C+FAKULTAS+MATEMATIKA+DAN+ILMU+PENGETAHUAN+ALAM+.+++++&rft.relation=http%3A%2F%2Fdigilib.unila.ac.id%2F30389%2F