Claim Missing Document
Check
Articles

Perencanaan Kanban Card Controller (KCC) dalam Pengendalian Tingkat Produksi Guna Meminimalisasi Kekurangan dan Kelebihan Produksi Garside, Annisa Kesy
Jurnal Teknik Industri Vol 1, No 1 (2000)
Publisher : Department Industrial Engineering, University of Muhammadiyah Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (3842.301 KB) | DOI: 10.22219/JTIUMM.Vol1.No1.20-30

Abstract

This  research  has  aim to plan  Kanban  Control  Card  (KCC)  in production   rate  controlling some  products  as:  Office  Table  (MTK),   Tower  Chest  Four  Flours  (TC-4),Tower    Chest  Six Flours (TC-6),   Simple Table  (MD).In this  research  we  need  data  such as  :   production   demand  data  history, production   lead time,   demand   forecasting   and  production   data  base  from demand  history   (  25  weekly  periodic), then  forecast   demand  in periodic  26 tli   using  Time  series  method  with  Trend  Analysis   in  a second periodic.Using  MRP  logic,  forecasting   result  account  to  result  Planed  Order  Release (PORs)  for each work  station.  From  the data analysis  can be found  :      the number  ofKanban    Card in each work station  of  production   devision    and the  second  is  less  maximum   inventory   value  than    inventory value using  MRP,  so TIT is  proved  not efective  in a fluctuative   production  rate.
A Cluster-First Route-Second Heuristic Approach to Solve The Multi-Trip Periodic Vehicle Routing Problem Garside, Annisa Kesy; Laili, Nabila Rohmatul
Jurnal Teknik Industri Vol 20, No 2 (2019): August
Publisher : Department Industrial Engineering, University of Muhammadiyah Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (346.527 KB) | DOI: 10.22219/JTIUMM.Vol20.No2.172-181

Abstract

This paper discusses periodic vehicle routing problems that allow vehicles to travel on multiple trips in a single day. It is known as the Multi-Trip Periodic Vehicles (MTPVRP) Problem Route. Cluster-first route-second (CFRS) heuristics to solve MTPVRP was proposed in this study. In phase 1, customers were divided into clusters using the formulation of integer programming. Phase 2 determined the route of the cluster and verifies that the total journey time to visit the trips does not exceed the working hours of the vehicle. The implementation of the heuristic CFRS to solve the real problem faced by the LPG distributor shows that the procedure could provide a better routing solution.
Perancangan Sistem Informasi Manajemen untuk DistribuTion Requirement Planning Garside, Annisa Kesy
Jurnal Teknik Industri Vol 2, No 2 (2001)
Publisher : Department Industrial Engineering, University of Muhammadiyah Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (3108.322 KB) | DOI: 10.22219/JTIUMM.Vol2.No2.128-137

Abstract

A cigaretec ompanyP, T. DjagungP adio fteng ot fouble or problemin distributionth eirproduct especially in acuracy of product delivery that cause lost sale. One of method that can beusedt o makea good deliverys cheduleis usingD istributionR equiremenPt lanning.lt makest heinformation of delivery schedule from factory to distribution or from distributor to company canbe fastly done and have high accuracy. It means that the company need a InformationManagement System ( SIM ).This research'sa ims in to designS IM and DRP in PT. DjagungP adi using thesemethod( systemt)h ef actoryc ans aveh oldingc ostl ack of productc osto f DjagungP adip roducta sDjagungP adi" hijau" andD jagungP adi" kuning" from Rp 1.782.900,0t0o Rp 867.300,00fo r amontha ndn o morel acko f productin distributions ystem.
MODEL SIMULTAN DAN DECOUPLED UNTUK PENYELESAIAN PROBLEM INTEGRASI PRODUKSI-PERSEDIAAN-DISTRIBUSI-PERSEDIAAN Garside, Annisa Kesy
Jurnal Teknik Industri Vol 10, No 1 (2008): JUNE 2008
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.9744/jti.10.1.pp. 11-25

Abstract

The necessity to cut costs and inventory along supply chain makes a more integrated decision between production and distribution functions becomes very important. The purpose of this research is to develop a simultaneous and decoupled optimization model to solve integrated production-inventory-distribution-inventory problem. The model is formulated as Mixed Integer Programming (MIP) with objective function minimizing total cost which covers fixed and variable production cost, plant and Distribution Center (DC) inventory cost, regular and overtime delivery cost. As the conclusion of the two models used to solve integrated production-inventory-distribution-inventory problem, the total cost of simultan model is smaller than the decoupled one. Abstract in Bahasa Indonesia: Tuntutan untuk mengurangi biaya-biaya dan persediaan sepanjang supply chain, menyebabkan pengambilan keputusan yang lebih terintegrasi diantara fungsi produksi dan distribusi menjadi sangat penting. Penelitian ini bertujuan untuk mengembangkan model simultan dan decoupled untuk menyelesaikan problem integrasi produksi-persediaan-distribusi-persediaan. Model simultan dan decoupled diformulasikan sebagai Mixed Integer Programming (MIP) dengan fungsi tujuan meminimalkan total biaya yang meliputi biaya produksi tetap dan variabel, biaya persediaan di pabrik dan Distribution Center (DC) serta biaya pengiriman secara reguler dan overtime. Dengan menggunakan kedua model untuk menyelesaikan problem integrasi produksi-persediaan-distribusi-persediaan, diperoleh total biaya model simultan lebih kecil dibanding model decoupled. Kata kunci: koordinasi supply chain, integrasi produksi-persediaan-distribusi-persediaan, mixed integer programming, pengiriman langsung, pendekatan decoupled.
MODEL SIMULASI UNTUK PENYELESAIAN PROBLEM INTEGRASI PRODUKSI-DISTRIBUSI Annisa Kesy Garside
Jurnal Gamma Vol. 4 No. 2 (2009): Maret
Publisher : Jurnal Gamma

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The analyticalmodel to solve the integration-production-distribution problem has drawbackof not able to accomodate the uncertainty of supply chain. This research aims to develop a simulationmodel to obtain a production and distribution plan that not only minimize the production anddistribution cost but also implementable in the real world situation.The steps of the research includes data generation, analytical model formulation and solutionmodel search, deterministic simulation model design based on generated data and analytical solutionmodel, verification test, running deterministic simulation model, validation test, stochastic simulationmodel design by incorporating uncertainty factor in terms of probabilistic production time andvehicle speed and validation of analytical solution model to determine whether the analytical modelsolution is worth to be implemented.The deterministic simulation and stochastic models were designed with ARENA simulationsoftware. Based on the stochastic running model, the total time for period one is higher than 48available hours so concluded that analytical solution model is not worth implemented.Keywords:. supply chain, production-distribution integration, analytical model, simulation model,deterministic, stochastic, ARENA software
Pengurangan Bullwhip Effect dengan Metode Vendor Managed Inventory Fenny Rubbayanti Dewi; Annisa Kesy Garside
Jurnal Optimasi Sistem Industri Vol. 14 No. 2 (2015): Published in 1st October 2015
Publisher : The Industrial Engineering Department of Engineering Faculty at Universitas Andalas

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (526.401 KB) | DOI: 10.25077/josi.v14.n2.p292-298.2015

Abstract

Information distortion caused PT Multi Sarana Indotani got higher demand than the distributor. Demand variability in each echelon of the supply chain (bullwhip effect) may occur due to lack of demand stability that the producer had difficulty in determining the amount of production. One of the collaboration methods that can be applied to overcome the information distortion as causes of the bullwhip effect is vendor managed inventory, where the needs of distributor and retailers monitored and controlled by the producer. In this case, vendor managed inventory applied to two echelons, producer, and distributor. 
Penjadwalan Flow Shop untuk Meminimasi Total Tardiness Menggunakan Algoritma Cross Entropy–Algoritma Genetika Dana Marsetiya Utama; Leo Rizki Ardiansyah; Annisa Kesy Garside
Jurnal Optimasi Sistem Industri Vol. 18 No. 2 (2019): Published in October 2019
Publisher : The Industrial Engineering Department of Engineering Faculty at Universitas Andalas

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (771.895 KB) | DOI: 10.25077/josi.v18.n2.p133-141.2019

Abstract

Flow shop scheduling problems much studied by several researchers. One problem with scheduling is the tardiness. Total tardiness is the performance to minimize tardiness jobs. it is the right performance if there is a due date. This study proposes the Cross-Entropy Genetic Algorithm (CEGA) method to minimize the mean tardiness in the flow shop problem. In some literature, the CEGA algorithm is used in the case of minimizing the makespan. However, CEGA not used in the case of minimizing total tardiness. CEGA algorithm is a combination of the Cross-Entropy Algorithm which has a function to provide optimal sampling distribution and Genetic Algorithms that have functions to get new solutions. In some numeric experiments, the proposed algorithm provides better performance than some algorithms. For computing time, it is affected by the number of iterations. The higher the iteration, computing requires high time.
Particle Swarm Optimization Algorithm to Solve Vehicle Routing Problem with Fuel Consumption Minimization Baiq Nurul Izzah Farida Ramadhani; Annisa Kesy Garside
Jurnal Optimasi Sistem Industri Vol. 20 No. 1 (2021): Published in May 2021
Publisher : The Industrial Engineering Department of Engineering Faculty at Universitas Andalas

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (988.497 KB) | DOI: 10.25077/josi.v20.n1.p1-10.2021

Abstract

The Conventional Vehicle Routing Problem (VRP) has the objective function of minimizing the total vehicles’ traveling distance. Since the fuel cost is a relatively high component of transportation costs, in this study, the objective function of VRP has been extended by considering fuel consumption minimization in the situation wherein the loading weight and traveling time are restricted. Based on these assumptions, we proposed to extend the route division procedure proposed by Kuo and Wang [4] such that when one of the restrictions can not be met the routing division continues to create a new sub-route to find an acceptable solution. To solve the formulated problem, the Particle Swarm Optimization (PSO) algorithm is proposed to optimize the vehicle routing plan. The proposed methodology is validated by solving the problem by taking a particular day data from a bottled drinking water distribution company. It was revealed that the saving of at best 13% can be obtained from the actual routes applied by the company.
Perbandingan Performasi Metode Johnson dengan Heuristik Multi Tujuan Ditinjau dari Makespan Total Flow Time dan Iddle Time Annisa Kesy Garside
Jurnal Teknik Industri Vol. 3 No. 2 (2002)
Publisher : Department Industrial Engineering, University of Muhammadiyah Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22219/JTIUMM.Vol3.No2.163-172

Abstract

This researchtd es to implementa methodo f rnachines chedulingfo r flow shopc alledMulti ObjectiveH euristicT. o makee asiera pplicationin attainingjo b sequencteh atm achinem ustdo alongw ith makespavna lue,l otal flow time, andi dle time,t hen a softwareis made Next, wemakea iomparisono f machines chedulingre sultp erformancbee tweenM ulti objectiveH euristicMethoda ndl ohnsonM ethodi f viewedf iom makespavna lue,t otalf low time,a ndi dlet ime. Fromthe resulto f researchc oncludedth at heuristic with multi objectivesm ethods howst he solutionsflow timet otalf ewert hanJ ohnsonm ethod
Analisa Alogaritma Layout Heuristik untuk Meminimasi Total Material handling dalam Perencanaan Tata Letak Fasilitas Annisa Kesy Garside
Jurnal Teknik Industri Vol. 3 No. 1 (2002)
Publisher : Department Industrial Engineering, University of Muhammadiyah Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22219/JTIUMM.Vol3.No1.22-32

Abstract

This research has goal to compare there alternative layout performances CRAFT,MULTIPLE, and BLOCPLAN. Using the problem of layout which include forward flow material and fordward backward flow material can be found result : Multiple Algoritm has total distance and material cost minimally but the problems that have lower departement,CRAFT algoritm can be used better than MULTIPLE algoritm because almost gives the same result with easier input process.