Articles
<![CDATA[DYNAMIC YARD TEMPLATE DESIGN TO IMPROVE UTILIZATION AND OPERATION EFFICIENCY ON VERTICAL LAYOUT-CONTAINER YARDS CONSIDERING UNCERTAINTY OF TRUCK ARRIVAL ]]>
<![CDATA[Siti Nurminarsih]]>;
<![CDATA[Maulin Masyito Putri]]>;
<![CDATA[Ahmad Rusdiansyah]]>
<![CDATA[ Journal of Engineering and Management in Industrial System Vol 6, No 2 (2018) ]]>
Publisher : <![CDATA[Badan Penerbit Jurnal, Faculty of Engineering, Universitas Brawijaya ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (1323.269 KB)
|
DOI: 10.21776/ub.jemis.2018.006.02.2
<![CDATA[Loading containers into a vessel can be delayed because of inefficient processes in the container yard. These container yard inefficient processes can be caused by inappropriate stacking position and inefficient crane operation. Inappropriate containers stacking positions may need some preparatory jobs of rearranging containers ahead of loading time to reduce delays in the process. The method will allow preparatory jobs to be scheduled together with main jobs to optimize use of the idle time of ASCs. This research aims to find a better scheduling strategy of twin ASCs as well as improving land utilization in a vertical-layout container yard to minimize delays in containers loading process. The uncertainty of truck arrival is accomodated by implementing iterative rescheduling in look-ahead planning horizon. The algorithm finds the optimal position of the container in the yard by implementing scoring function for each available slot. Finally, some numerical experiments are conducted to prove the performance of the algorithm.]]>
<![CDATA[Development of Risk Evaluation and Mitigation Systems for Logistics System ]]>
<![CDATA[Ahmad Rusdiansyah]]>;
<![CDATA[Della Deswiana Pratama]]>;
<![CDATA[Muhammad Faisal Ibrahim]]>
<![CDATA[ Jurnal Teknik Industri Vol. 21 No. 1 (2020): February ]]>
Publisher : <![CDATA[Department Industrial Engineering, University of Muhammadiyah Malang ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (353.932 KB)
|
DOI: 10.22219/JTIUMM.Vol21.No1.92-103
<![CDATA[Logistic activities are significant activities that pose various risks for the company. These risks can affect the company’s performance. To be able to compete in the globalization era, companies need proper risk management. This study aimed to develop Risk Evaluation and Mitigation Systems. We offered four stages: risk identification, risk analysis, risk evaluation, and risk response. A case study was conducted to implement the proposed Risk Evaluation and Mitigation Systems. The results indicated that the proposed Risk Evaluation and Mitigation Systems were proven to be appropriately applied to evaluate company risks and provide mitigation recommendations.]]>
<![CDATA[A Three-Phased Perishable Inventory Simulation Model with Quality Decrease Consideration ]]>
<![CDATA[Muhammad Faisal Ibrahim]]>;
<![CDATA[Yunita Siti Mardhiyyah]]>;
<![CDATA[Ahmad Rusdiansyah]]>;
<![CDATA[Meidina Kalse Boer]]>;
<![CDATA[Dana Marsetiya Utama]]>
<![CDATA[ Jurnal Ilmiah Teknik Industri Vol. 19, No. 02, December 2020 ]]>
Publisher : <![CDATA[Department of Industrial Engineering Universitas Muhammadiyah Surakarta ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.23917/jiti.v19i2.11769
<![CDATA[In this article, focus on the simulation of a three-phase perishable product inventory system of a SMEs selling fresh and processed milkfish. This research was conducted to simulate a perishable product inventory system to understand and analyze the problems that occur then propose solutions to fix them. The simulation model was developed with ARENA software, simulation results of the existing condition show that there is 162 kg/month waste in fresh fish, 158 pcs/month in processed product A, and 86 pcs/month in processed product B. A model with a product renewal process mechanism was proposed to overcome this problem, and seven improvement scenarios were developed. The results obtained from the seventh improvement scenario revealed that there was a 100% reduction in fresh fish and processed product B and 94% in processed product A. Besides, there was a saving in need for fresh fish supply of 10 kg/day. In this article, we show how ARENA software can be adopted to simulate inventory system problems effectively. The method in this research can be applied to investigate various supply system scenarios and their consequences before implementing it in a real system.]]>
<![CDATA[Analysis of Bulk Cement Distribution Network Considering Market Share and Operating Income after Acquiring the Competitor ]]>
<![CDATA[Akma Kurniawan]]>;
<![CDATA[Ahmad Rusdiansyah]]>
<![CDATA[ IPTEK Journal of Proceedings Series No 5 (2020): The 8th International Conference on Transportation & Logistics (T-LOG 2020) ]]>
Publisher : <![CDATA[Institut Teknologi Sepuluh Nopember ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.12962/j23546026.y2020i5.7925
<![CDATA[The distribution network is the most important strategic decision issues that need to be optimized for the efficient operation of whole supply chain. When a company make a business acquisition that brings more distribution facilities, the location allocation planning of the distribution network needs to be reconsidered. The distribution network includes the link from factories to packing plants and from factories or packing plants to demand points. The linear programming model was developed as a solution to solve optimization problem which involves multisource, multiproduct, and multipored in multi-echelon distribution network. We build numerical experiments from two scenarios to show the behaviour of this model. This model will determine the decision of distribution facilities location should be used and quantities should be allocated to achieve the optimal operating income considering the market share policy to satisfy the customer demands.]]>
<![CDATA[Dynamic Simulation to Minimize Inventory Cost of Coal Considering Uncertainty Demand of Product ]]>
<![CDATA[Muyasaroh Effendi]]>;
<![CDATA[Ahmad Rusdiansyah]]>
<![CDATA[ IPTEK Journal of Proceedings Series No 5 (2020): The 8th International Conference on Transportation & Logistics (T-LOG 2020) ]]>
Publisher : <![CDATA[Institut Teknologi Sepuluh Nopember ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.12962/j23546026.y2020i5.7926
<![CDATA[This paper briefly discusses the inventory management of coal in a cement industry. The cement company uses coal as fuel in the production process. Continuous production process must be maintained, thus the coal supply must be met to the production demand. In this study, we develop a dynamic simulation of coal inventory control system. We implemented periodic review system (P system) and continuous review system (Q system) method. Our simulation scenario consider some decision variables such as supply, variation of demand, and fluctuation of demand in order to understand the behaviour of the proposed model. This method is expected to provide recommendations for improve the inventory control policies in determining the optimum amount of coal in the warehouse and the optimal interval between orders with a minimum total inventory cost at uncertainty demand condition of product clinker and cement. ]]>
<![CDATA[PEMODELAN DAN PENYELESAIAN PERMASALAHAN PENJADWALAN PILOT DENGAN METODE EKSAK DEKOMPOSISI ]]>
<![CDATA[Ahmad Rusdiansyah]]>;
<![CDATA[Yani Dhina Mirenani]]>;
<![CDATA[Zya Labiba]]>;
<![CDATA[Nurhadi Siswanto]]>
<![CDATA[ Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 9 No. 2 (2007): DECEMBER 2007 ]]>
Publisher : <![CDATA[Institute of Research and Community Outreach - Petra Christian University ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (315.97 KB)
|
DOI: 10.9744/jti.9.2.112-124
<![CDATA[Crew scheduling is one of most important operational problems in airline industries. Crew scheduling Problem consists of two steps that is "Crew Pairing" and "Crew Rostering". The research focusses on building Boeing 737-200's monthly pilot rostering of PT. X Airlines based on given pilot pairings. There are some vertical and horizontal regulations must be fulfilled in so that the problem becomes very complex and cannot be solved using a pure exact method in reasonable computational time. Accordingly, we propose a decomposition exact method to solve the problem. Our model was run using LINGO Optimization software. Experiment results showed that our schedules are outperform than the existing schedules of the airline for the case of May 2006. Abstract in Bahasa Indonesia : Penjadwalan kru pada suatu maskapai penerbangan merupakan salah satu permasalahan operasional yang terpenting. Penjadwalan kru terdiri dari dua tahapan yaitu tahap pengelompokkan kru dan penugasan kru. Penelitian ini memfokuskan pada pembuatan jadwal penugasan pilot pesawat Boeing 737-200 pada maskapai penerbangan PT. X Airlines yang ber-home base di Surabaya selama satu bulan, berdasar pada hasil pengelompokkan pilot yang telah ditentukan sebelumnya. Terdapat sejumlah peraturan horizontal dan vertikal yang harus dipenuhi membuatnya menjadi permasalahan kombinatorial yang sangat kompleks, sehingga tidak dapat diselesaikan dengan menggunakan metode eksak murni dalam waktu yang wajar. Untuk itu digunakan metode eksak dekomposisi. Model tersebut diterjemahkan menggunakan perangkat lunak optimisasi LINGO. Hasil eksperimen menunjukkan bahwa jadwal penugasan pilot yang dibuat dengan metode ini lebih baik daripada jadwal milik perusahaan untuk kasus pada bulan Mei 2006. Kata kunci: penjadwalan pilot, pengelompokkan pilot, aturan horizontal dan vertikal, metode eksak dekomposisi]]>
<![CDATA[Model of Dynamic Pricing for Two Parallels Flights with Multiple Fare Classes Based on Passenger Choice Behavior ]]>
<![CDATA[Ahmad Rusdiansyah]]>;
<![CDATA[Dira Mariana]]>;
<![CDATA[Hilman Pradana]]>;
<![CDATA[Naning A. Wessiani]]>
<![CDATA[ Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri Vol. 12 No. 1 (2010): JUNE 2010 ]]>
Publisher : <![CDATA[Institute of Research and Community Outreach - Petra Christian University ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (292.636 KB)
|
DOI: 10.9744/jti.12.1.9-16
<![CDATA[Airline revenue management (ARM) is one of emerging topics in transportation logistics areas. This paper discusses a problem in ARM which is dynamic pricing for two parallel flights owned by the same airline. We extended the existing model on Joint Pricing Model for Parallel Flights under passenger choice behavior in the literature. We generalized the model to consider multiple full-fare class instead of only single full-fare class. Consequently, we have to define the seat allocation for each fare class beforehand. We have combined the joint pricing model and the model of nested Expected Marginal Seat Revenue (EMSR) model. To solve this hybrid model, we have developed a dynamic programming-based algorithm. We also have conducted numerical experiments to show the behavior of our model. Our experiment results have showed that the expected revenue of both flights significantly induced by the proportion of the time flexible passengers and the number of allocated seat in each full-fare class. As managerial insights, our model has proved that there is a closed relationship between demand management, which is represented by the price of each fare class, and total expected revenue considering the passenger choice behavior.]]>
<![CDATA[Space-sharing Strategy for Building Dynamic Container Yard Storage Considering Uncertainty on Number of Incoming Containers ]]>
<![CDATA[Siti Nurminarsih]]>;
<![CDATA[Ahmad Rusdiansyah]]>;
<![CDATA[Maulin Masyito Putri]]>
<![CDATA[ Jurnal Teknik Industri Vol. 19 No. 2 (2017): Desember 2017 ]]>
Publisher : <![CDATA[Institute of Research and Community Outreach - Petra Christian University ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (610.379 KB)
|
DOI: 10.9744/jti.19.2.67-74
<![CDATA[The implementation of AEC (Asian Economic Community) leads to demand increase at ports in Indonesia. This increasing demand is followed by operational efficiency at the port as well. In fact, ports in Indonesia have an average dwell time for 5 days. One of the causes of this long dwell time is container transfer inefficiencies during loading process. In this research, we will focus in yard management and increasing land utilization. To increase the land utilization, we develop the space-sharing concept to reduce the initial space needed for a given workload. Since the ships arrivals are also varying, this concept will be possible. We develop the concept by adding uncertainty on number of incoming containers at operational level as the determining factor in planning a shared yard area. We propose a simulation approach to evaluate strategies in making yard template.]]>
<![CDATA[A Hybrid Scatter Search Heuristic Algorithm for Solving Cockpit Crew Rostering ]]>
<![CDATA[Ahmad Rusdiansyah]]>;
<![CDATA[Danim Musthofa]]>;
<![CDATA[Nurhadi Siswanto]]>;
<![CDATA[Maulin Masyito Putri]]>
<![CDATA[ Jurnal Teknik Industri Vol. 20 No. 2 (2018): December 2018 ]]>
Publisher : <![CDATA[Institute of Research and Community Outreach - Petra Christian University ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (709.28 KB)
|
DOI: 10.9744/jti.20.2.141-152
<![CDATA[This research introduces the development of Hybrid Scatter Search Heuristic for solving cockpit crew (pilot and co-pilot) rostering problem. This research aims to minimize the deviation of flight hours among the cockpit crew of an airline, Garuda Indonesia Airline, during the one-month planning horizon. The weakness of the existing algorithm used in the airline, which is a trial-and-error algorithm, is that the variation among crew flight times for one month is too significant and the scheduling process takes a quite long time. We tested the performance of our proposed algorithm to that of the existing algorithm. The numerical experiments showed that the proposed algorithm had outperformed the existing algorithm. More specifically, we found some in sensitivity analysis experiments. Our experiment results showed that that the higher the flight time target, the higher the total deviation of flight time. We also conducted several experiments to show the robustness of our proposed algorithm. First, we tested the relationship between the number of pilots who can use their preferences and the total deviation of flight time. We conducted experiments by giving the cockpit crew the opportunity to choose a day off. Finally, we analyzed the results by changing the number of cockpit crew.]]>
<![CDATA[Metaheuristics for The Solution of Dynamic Vehicle Routing Problem With Time Windows (DVRPTW) With Travel Time Variable ]]>
<![CDATA[Nurlita Gamayanti]]>;
<![CDATA[Abdullah Alkaff]]>;
<![CDATA[Ahmad Rusdiansyah]]>
<![CDATA[ JAREE (Journal on Advanced Research in Electrical Engineering) Vol 1, No 1 (2017): April ]]>
Publisher : <![CDATA[Department of Electrical Engineering ITS and FORTEI ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.12962/j25796216.v1.i1.13
<![CDATA[This research is focusing on the development of metaheuristic algorithm to solve Dynamic Vehicle Routing Problem With Time Windows (DVRPTW) for the service provider of Inter-city Courier. The algorithm is divided into two stages which is static stage and dynamic stage. In the static stage, modified Ant Colony System is developed and in the dynamic stage, Insertion Heuristic is developed. In DVRPTW, vehicle’s routes are raised dynamically based on real time information, for example the reception of new order. To test the performances of the developed metaheuristic algorithm, the author compares the developed algorithm with the nearest neighbor algorithm and with the combination between the nearest neighbor and insertion heuristics algorithm. Experiment is done using Chen’s standard data test. The developed metaheuristic algorithm was applied on the network data of the roads in Surabaya, where the routes generated not only determine the order that the consumer must visit but also determine the routes that must be passed. After the experiment, the author conclude that the developed algorithm generates a better travel time total than the nearest neighbor and the combination between the nearest neighbor and insertion heuristics and can also generate route dynamically to respond to the new order well. Keywords: Inter-City Courier, Dynamic Vehicle Routing Problem dengan Time Window (DVRPTW), Ant Colony System, Insertion Heuristics]]>
