USULAN PENJADWALAN PRODUKSI PADA ALIRAN FLOWSHOP DENGAN ALGORITMA GENETIKA UNTUK MEMINIMASI MAKESPAN
| Main Author: | LATIF BAYANI, LATIF BAYANI |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | ind |
| Terbitan: |
, 2015
|
| Subjects: | |
| Online Access: |
https://eprints.untirta.ac.id/10799/1/Usulan%20Penjadwalan%20Produksi%20pada%20Aliran%20Flowshop%20dengan%20Algoritma%20genetika%20untuk%20meminimasi%20make2.pdf https://eprints.untirta.ac.id/10799/ |
Daftar Isi:
- CV. Serang Teknindo is a company engaged in manufacturing. Frequent delays in product shipments cuople the reason cuople product needs to be done sorting work or production scheduling. Scheduling is the manufacture of the product thoroughly sorting is done on be some machines. The purpose of this study is to determine the optimal sequence of jobs in CV.Serang Teknindo order to obtain the minimum makespan by using genetic algorithm and to determine the minimum makespan value resulting from the scheduling is done. In the calculation of the genetic algorithm approach, the initial population is selected from the results of the calculation algorithm to choose two sequences CDS better. Furthermore, the crossover and mutation to get a new parent is selected through the selection. Crossover method does is Partially Mapped Croccover (PMX), which carried a mutation method is Reciprocal Exchange Mutation (REM), while the selection method used is Steady-state Selection. Based on data processing, the result for the optimal sequence of jobs in production scheduling in stream flow shop using genetic algorithm is 1-2-5-6-4-3 or sequence of jobs to be done starting from the product of two terms cuople, then cuople triangle inside, then cuople hexagon inside, then cuople octagonal in, then cuople rectangle inside, then the last job is done is cuople trapezoid and minimum makespan resulting from scheduling has been done is equal to 23252.24 minutes.