Abstract
Production scheduling aims to minimize processing time, waiting time, and inventory levels, as well as efficient use of facilities, labor, and also equipment. In producing these products there is usually ineffectiveness in the scheduling process, such as sorting jobs that are not optimal so that the production requires a long time to produce products in large quantities. Therefore improving performance in order to increase productivity must be carried out continuously considering tremendously strict competition in the industry and manufacturing sector. This study is aimed to minimize the makespan value by scheduling the job sequence optimally. In this study, simulated Annealing Algorithm is used as one of the algorithms for generic optimization that is then compared to the algorithm used by companies. Based on the data processing, the maximal iteration has been reached with 2 iterations. The last iteration is selected which has the smallest makespan value, namely J2-J4-J3-J1 schedule with makespan value of 18,811.2 minutes. The makespan value obtain by simulated annealing algorithm is considered 9.03% more efficient compared to the companies method.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.