Yanuarsih, Susi (2015) Analisis kriteria dan pemilihan basis tempat Aplikasi aljabar max-plus pada penjadwalan flowshop dengan menggunakan timed petri net. Undergraduate thesis, Institut Teknologi Sepuluh Nopember.
Preview |
Text
1211100096-Undergraduate_Thesis.pdf Download (1MB) | Preview |
Abstract
Aljabar Max-Plus merupakan salah satu teknik analisis
pengkajian dari sistem event diskret yang mempunyai
banyak aplikasi pada teori sistem, Petri net dan teori
graph. Salah satu aplikasinya adalah pada penjadwalan
sistem produksi. Pada penelitian ini, didesain penjadwalan
sistem produksi flowshop. Di dalam penelitian ini
dibahas masalah penjadwalan 5 workstation dan 3 job.
Dari data yang ada dibuat sinkronisasi antar mesin.
Dari sinkronisasi tersebut dicari permutasi urutan job
yang optimal, dengan menggunakan algoritma Branch dan
Bound dengan pendekatan Aljabar Max-Plus. Selanjutnya,
dikonstruksi model petri net dan Aljabar Max-Plus untuk
menentukan jadwal pemrosesan job di masing - masing mesin.
Berdasarkan studi kasus di UKM Rizki Makmur, didapat
model dinamik X(k) = M ⊗ X(k − 1), serta urutan job
yang mengoptimalkan makespan (jangka waktu selesainya
seluruh job) yang dihasilkan adalah job 2 (pembuatan kusen),
job 3 (pembuatan jendela), job 1 (pembuatan pintu) dengan
makespan sebesar 170 menit.
===================================================================================================
Max-plus Algebra is one of the engineering assessment
analysis of discrete event systems which have many
applications on systems theory, Petri net and graph theory.
One of its application is production scheduling system. In this
research, flowshop production scheduling system is designed.
In this research scheduling issues of 5 workstation and 3 job
is discussed. From the existing data, synchronization between
machines created. From the synchronization will be sought
permutation of optimal job sequence, using Branch and Bound
Algorithm with Max-Plus Algebra approach. Furthermore,
the model is constructed petri net and Max-Plus algebra to
determine the schedule of job processing in each machine.
Based on case studies in UKM Rizki Makmur, obtained the
dynamic model X(k) = M ⊗ X(k − 1), we can get the job
sequence that optimizes makespan (term of completion of the
entire job), the sequence generated job is a job 2 (manufacture
frames), job 3 (manufacture of windows), job 1 (manufacture
of doors) with makespan of 170 minutes.
| Item Type: | Thesis (Undergraduate) |
|---|---|
| Additional Information: | RSMa 512 Yan a |
| Uncontrolled Keywords: | Aljabar Max-Plus, Timed Petri Net, Penjadwalan Flowshop |
| Subjects: | Q Science > QA Mathematics > QA184 Algebra, Linear |
| Divisions: | Faculty of Mathematics and Science > Mathematics > 44201-(S1) Undergraduate Thesis |
| Depositing User: | - Taufiq Rahmanu |
| Date Deposited: | 19 Nov 2019 07:45 |
| Last Modified: | 19 Nov 2019 07:45 |
| URI: | http://repository.its.ac.id/id/eprint/71877 |
Actions (login required)
 |
View Item |