OPTIMASI WAKTU PRODUKSI MENGGUNAKAN ALGORITMA CAMPBELL DUDEK AND SMITH (CDS) PADA PT. LOGAM JAYA

  • ๐Œ๐š๐ฌ๐ก๐ฎ๐ซ๐ข S1 Sistem Informasi Fakultas Teknologi Informasi, Universitas Hasyim Asyโ€™ari
  • ๐˜๐ฎ๐๐ข๐š๐ง๐ญ๐จ ๐€๐ซ๐ฌ๐š๐ฆ S1 Teknik Informatika, Fakultas Teknologi Informasi, Universitas Hasyim Asyโ€™ari
  • ๐’๐ฎ๐ฃ๐š๐ญ๐ฆ๐ข๐ค๐จ S1 Pendidikan Teknologi Informasi Fakultas Teknik, Universitas Negeri Surabaya

Abstract

Research has been done with the title Optimization of Production Time Using Campbell Dudek And Smith
Algorithm (CDS) on PT. Logam Jaya which aims to determine the order of the machine's operating
schedule for producing 12 size pans, 14 size pans, 16 size pans, 18 size pans and 20 optimal size pans,
making optimal numbers. The method used in this research is Campbell Dudek and Smith (CDS), CDS is
one of the methods used in a plot developed from Johnson's rules. Johnson's rule is the general rule of
making two machines designed in series. The CDS method produces several iterations that have an
makespan value, from several iterations, namely the minimum minimum to determine the order of products
to be produced by the machine. The results of this study are an application that can be exploited by a
product that will be produced by the machine automatically. From the results of testing with a production
number of 12 pieces per fruit as much as 6 times, the results obtained are very minimal, namely 210.12
minutes with the order the product 20 size pans ห— 18 size pans ห— 16 size pans ห— 14 size pans ห— 12 size pans.
Accuracy of the results The payment application shows 99 , 99% for the first time and 99.96% for the
second time when compared to manual calculations
Keywords: Optimation, Production, Flowshop, Campbell Dudek and Smith, Makespan

Published
2019-09-22