MINIMASI MEAN TARDINESS PADA PENJADWALAN FLOWSHOP DENGAN ALGORITMA SIMULATED ANNEALING (CV. HASTA SURYA MANDIRI)
| Main Author: | Tawadhu, Reila Jannah |
|---|---|
| Format: | Thesis NonPeerReviewed Book |
| Bahasa: | eng |
| Terbitan: |
, 2018
|
| Subjects: | |
| Online Access: |
http://eprints.umm.ac.id/43763/1/PENDAHULUAN.pdf http://eprints.umm.ac.id/43763/2/BAB%20I.pdf http://eprints.umm.ac.id/43763/3/BAB%20II.pdf http://eprints.umm.ac.id/43763/4/BAB%20III.pdf http://eprints.umm.ac.id/43763/5/BAB%20IV.pdf http://eprints.umm.ac.id/43763/6/BAB%20V.pdf http://eprints.umm.ac.id/43763/7/BAB%20VI.pdf http://eprints.umm.ac.id/43763/8/Lampiran.pdf http://eprints.umm.ac.id/43763/ |
Daftar Isi:
- Proper job sequence scheduling is essential for companies to minimize the mean tardiness. So that the company can fulfill orders on time in accordance with the due date given by the customer and can increase customer confidence. In this research discussed scheduling job sequences using simulated annealing algorithm and NEH-EDD as an initial solution with the help of Matlab computation. Simulated annealing is an algorithm that mimics the behavior of a steel cooling process in order to produce the best crystals and use the least possible energy. While the purpose of the NEH-EDD algorithm used as initial solution in Simulated Annealing algorithm is to accelerate the process of finding the best solution (global optimum). Problems encountered by the company is to determine the order of job type flow shop that can minimize mean time of delay (mean tardiness). This is based on production data in December 2017 which still occur delay seen from the time of completion of all types of jobs. The NEH-EDD-Simulated Annealing method gets the optimum mean tardiness value from the actual scheduling.