Claim Missing Document
Check
Articles

Found 6 Documents
Search

Perencanaan dan Pengendalian Produksi Dalam Sistem Logistik (Pendekatan Berbasis Praktikum Laboratorium) Ruswandi, Nanda; Herlina, Rohma; Suri, Faras Karningtia; Dianisa, Pramesti Adwinda; Sandi, Evelyn; Sukarno, Iwan; Liperda, Rahmad Inca; Lusiani, Mirna
UNISTEK Vol 8 No 2 (2021): Agustus 2021 - Januari 2022
Publisher : UNIVERSITAS ISLAM SYEKH - YUSUF TANGERANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33592/unistek.v8i2.1151

Abstract

The concept of Production Planning and Control is closely related to logistics activities, including in determining the production of a product. Production planning and control aims to get a complete picture of how to plan and control production in the industry of each company, so that all costs can be reduced. Production planning, Rough Cut Capacity Planning (RCCP), Material Requirement Planning (MRP), Capacity Requirement Planning (CRP), and Line Balancing are some of the steps that need to be done in providing an overview of the production planning and control system at the "Tamiya" Company. Production planning results in the amount of "Tamiya" production in a certain period by considering SEE and the most appropriate production strategy that results in total costs. MPS validation considerations are the output of the RCCP calculation, a comparison of the ratio of the required capacity to the capacity of the company. The MRP stage reduces production due to material unavailability, the result is the best material scheduling based on the lot sizing method which provides the lowest cost. CRP generates Planned Input and Planned Output per work station to see the balance between load and capacity. Line Balancing functions to balance assignments through the Ranking Position Weight (RPW) and Presedence Diagram methods, getting results in the form of updating the layout of the assignment so that the efficiency of the production line can be improved
ANALISIS RISIKO K3 PADA JASA KEPELABUHAN DENGAN METODE HIRARC (HAZARD IDENTIFICATION RISK ASSESMENT AND RISK CONTROL) Ramdhani A., A Nur Shafirah; Liperda, Rahmad Inca; Ruswandi, Nanda
INFOTECH journal Vol. 9 No. 1 (2023)
Publisher : Universitas Majalengka

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31949/infotech.v9i1.5064

Abstract

PT. Pelabuhan Indonesia (Pelindo) is a world-class port offering integrated services between Indonesian ports. The establishment of Perind as a result of this integration is a strategic initiative of the government as a shareholder to realize national connectivity and a stronger logistics ecosystem network. This study was conducted with the aim of identifying hazards, assessing risks, and managing port service activities. Use HIRARC (Hazard, Identification, Risk Assessment and Risk Management) and SWOT (Strength, Weakness, Opportunity, and Threat) methods to identify hazards and perform risk assessments. With the use of the HIRARC method, 10 potential risks were found in one green risk assessment indicating that the potential problem was moderate. For inventory warehouse personnel activities, the value is 3, and the warehouse worker or worker unloading value is 3. Mixed strategies can be found in the four quadrants of analysis using SWOT for the following purposes: Improving and improving the quality of the company.
Economic Order Quantity Method to Enhance Rice Supplies and Food Security in Indonesia Liperda, Rahmad Inca; Ruswandi, Nanda; Apriliani, Dea Nurfirda
Jurnal Manajemen Transportasi & Logistik (JMTRANSLOG) Vol 11, No 2 (2024): Juli
Publisher : Institut Transportasi dan Logistik Trisakti

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.54324/j.mtl.v11i2.1306

Abstract

Ensuring adequate food provision to meet human basic needs is of utmost importance. In Indonesia, achieving food security involves meeting the food requirements of all individuals and eliminating the risk of famine. The government's strategy to ensure national food security centers on maintaining a steady supply of rice throughout the year, recognizing its paramount significance. To address this concern, this study aims to enhance rice supplies at Gudang Bulog Baru Tempel Lemahbang 202 Blora by implementing the economic order quantity (EOQ) method. The research findings demonstrate that by utilizing the EOQ method, the optimal rice supply order size would be 15,319.4 tons. This order should be placed 119 times per year, given the 280 business days available. The annual cost of implementing this policy at Gudang Bulog Baru Tempel Lemahbang 202 Blora is estimated to be Rp. 424,484,526. Implementing the EOQ method proves beneficial in minimizing the cost for individual rice orders due to its high frequency throughout the year, which directly affects the total cost. Nevertheless, it is crucial to reassess alternative policies to further reduce the overall cost incurred in both the short and long term if the objective of the EOQ method is cost minimization.Top of Form 
Wind Turbine Production Planning in Logistic Systems Ruswandi, Nanda; Febriyani Hutasuhut, Dhian; Putri Fadillah, May; Ievana Febrianty Rumalutur, Yizri; Sukarno, Iwan; Inca Liperda, Rahmad
Journal of Emerging Supply Chain, Clean Energy, and Process Engineering Vol 1 No 2 (2022): Journal of Emerging Supply Chain, Clean Energy, and Process Engineering
Publisher : Universitas Pertamina

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.57102/jescee.v1i2.22

Abstract

Production planning is very important in an industrial company as well as planning in Logistics. The purpose of implementing production planning in a company is to minimize costs incurred and maximize profits. This research is practicum-based research in the laboratory with the object of observation in the form of a wind turbine toy. This object will be processed through 5 stages in the production process starting from forecasting, RCCP (Rough Cut Capacity Planning), MRP (Material Requirement Planning), CRP (Capacity Requirement Planning), and Line Balancing. forecasting results are carried out with 12 future periods producing 232,888 units, RCCP balance between available capacity and required capacity, MRP using the lot sizing technique obtains the cheapest cost per unit Rp.142,179 with the LTC (Least Total Cost) method when compared to other MRP methods, namely LFL (Lot for Lot), POQ (Period Order Quantity), PPB (Part Period Balancing), EOQ (Economic Order Quantity), and LUC (Least Unit Cost), CRP by calculating the number of machines and working time, and line balancing which results in a decrease in track ineffectiveness from 42% to 22% and Smoothness Index from 476,662 to 189,703.
Simulated annealing algorithm for solving the capacitated vehicle routing problem: a case study of pharmaceutical distribution Redi, Anak Agung Ngurah Perwira; Maula, Fiki Rohmatul; Kumari, Fairuz; Syaveyenda, Natasha Utami; Ruswandi, Nanda; Khasanah, Annisa Uswatun; Kurniawan, Adji Chandra
Jurnal Sistem dan Manajemen Industri Vol. 4 No. 1 (2020)
Publisher : Universitas Serang Raya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30656/jsmi.v4i1.2215

Abstract

This study aims to find a set of vehicles routes with the minimum total transportation time for pharmaceutical distribution at PT. XYZ in West Jakarta. The problem is modeled as the capacitated vehicle routing problem (CVRP). The CVRP is known as an NP-Hard problem. Therefore, a simulated annealing (SA) heuristic is proposed. First, the proposed SA performance is compared with the performance of the algorithm form previous studies to solve CVRP. It is shown that the proposed SA is useful in solving CVRP benchmark instances. Then, the SA algorithm is compared to a commonly used heuristic known as the nearest neighborhood heuristics for the case study dataset. The results show that the simulated Annealing and the nearest neighbor algorithm is performing well based on the percentage differences between each algorithm with the optimal solution are 0.03% and 5.50%, respectively. Thus, the simulated annealing algorithm provides a better result compared to the nearest neighbour algorithm. Furthermore, the proposed simulated annealing algorithm can find the solution as same as the exact method quite consistently. This study has shown that the simulated annealing algorithm provides an excellent solution quality for the problem.
Implementasi Algoritma Discrete Particle Swarm Optimization Pada Permasalahan CVRP Aisyahna Nurul Mauliddina; Nagari, Adesatya Lentera; Redi, Anak Agung Ngurah Perwira; Kurniawan, Adji Candra; Ruswandi, Nanda; Faris Ahmad Saifuddin
Jurnal Sistem dan Manajemen Industri Vol. 4 No. 2 (2020)
Publisher : Universitas Serang Raya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30656/jsmi.v4i2.2607

Abstract

Capacitated Vehicle Routing Problem (CVRP) is known as an NP-hard problem. It is because CVRP problems are very hard for finding optimal solutions, especially in large instances. In general, the NP-hard problem is difficult to solve in the exact method, so the metaheuristic approach is implemented in the CVRP problem to find a near-optimal solution in reasonable computational time. This research uses the DPSO algorithm for solving CVRP with ten instances of benchmark datasets. DPSO implementation uses tuning parameters with the One Factor at Time (OFAT) method to select the best DPSO parameters. The outcome objective function will be compared with several PSO models proposed in previous studies. Statistical test using One Way Reputed Measure ANOVA is needed to compare algorithm performance. First, ANOVA uses for comparing’s results. Then, ANOVA is also used to test DPSO’s performance compared with DPSO-SA, SR-1, and SR-2 algorithm. The computational result shows that the basic DPSO algorithm not competitive enough with other methods for solving CVRP.