PERENCANAAN KEBUTUHAN KONTAINER UNTUK MEMINIMASI BIAYA PENGIRIMAN DENGAN MENGGUNAKAN INTEGER PROGRAMMING (Studi Kasus PT. Glori Industrial II Semarang)

Abstract

PT. Glori Industrial II Semarang is one of company that has a garment export market. In the export of goods, the path often used is the sea route by using a cargo or containers. Loading cargo is one of the crucial issues that are often encountered. Selection of suitable containers and how the allocation of product items to be sent will directly affect the cost of shipping. Multicontainer based theories such as bin packing problem, multiple knapsack problem, bin covering, and min-cost covering integer programming, planning will be done on both these issues. In this case study, the proposed method is proposed using binary integer programming as a tool for finding solutions while solving an integer programming formulation using Lingo software assistance. Using 3rd September 2010 shipment data by 20 purchase orders (PO), found that the Container Requirement Planning using the proposed method will result in cost savings of U.S. $ 912.67. This figure can be quite large for local delivery fee charge. Keywords : Container Loading Planning, Container Requirement Planning, Integer programming,