Ahmad Rusdiansyah
Fakultas Teknologi Industri, Jurusan Teknik Industri, Tran¬s¬por¬tation and Distribution Logistics (TDLog) Research Group, Labo¬rato¬¬rium Logistics and Supply Chain Management (LSCM), Institut Teknologi Sepuluh Nopember Surabaya, Kampus Keput

Published : 12 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 12 Documents
Search

Space-sharing Strategy for Building Dynamic Container Yard Storage Considering Uncertainty on Number of Incoming Containers Nurminarsih, Siti; Rusdiansyah, Ahmad; Putri, Maulin Masyito
Jurnal Teknik Industri Vol 19, No 2 (2017): Desember 2017
Publisher : 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

Abstract

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.
Joint Economic Lot Sizing Optimization in a Supplier-Buyer Inventory System When the Supplier Offers Decremental Temporary Discounts Sari, Diana Puspita; Rusdiansyah, Ahmad
J@ti Undip : Jurnal Teknik Industri Volume 3, No.3, September 2008
Publisher : Departemen Teknik Industri, Fakultas Teknik, Universitas Diponegoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (436.302 KB) | DOI: 10.12777/jati.3.3.214-225

Abstract

This research discusses mathematical models of joint economic lot size optimization in a supplier-buyer inventory system in a situation when the supplier offers decremental temporary discounts during a sale period. Here, the sale period consists of n phases and the phases of discounts offered descend as much as the number of phases. The highest discount will be given when orders are placed in the first phase while the lowest one will be given when they are placed in the last phase. In this situation, the supplier attempts to attract the buyer to place orders as early as possible during the sale period. The buyers will respon these offers by ordering a special quantity in one of the phase. In this paper, we propose such a forward buying model with discount-proportionally-distributed time phases. To examine the behaviour of the proposed model, we conducted numerical experiments. We assumed that there are three phases of discounts during the sale period. We then compared the total joint costs of special order placed in each phase for two scenarios. The first scenario is the case of independent situation – there is no coordination between the buyer and the supplie-, while the second scenario is the opposite one, the coordinated model. Our results showed the coordinated model outperform the independent model in terms of producing total joint costs. We finally conducted a sensitivity analyzis to examine the other behaviour of the proposed model. Keywords: supplier-buyer inventory system, forward buying model, decremental temporary discounts, joint economic lot sizing, optimization.  
A CROW SEARCH ALGORITHM FOR AIRCRAFT MAINTENANCE CHECK PROBLEM AND CONTINUOUS AIRWORTHINESS MAINTENANCE PROGRAM Siswanto, Nurhadi; Adianto, Asyraf Nur; Prawira, Hasan Aji; Rusdiansyah, Ahmad
Jurnal Sistem dan Manajemen Industri Vol 3, No 2 (2019)
Publisher : Universitas Serang Raya

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

Abstract

This research discusses the maintenance problem of a small commer­cial aircraft with propeller engine, typed ATR-72. Based on the main­­tenance records, the aircraft has average 294 routine activities that have to be monitored and done based on determined threshold interval. This research focuses on developing a meta­heuristic model to optimize the aircraft?s utility, called Crow Search Algorithm (CSA) to solve the Aircraft Maintenance Problem (AMP). The algorithm is developed and tested  whether a younger meta­heuristic method, CSA, is able to give better performance compar­ed to the older methods, Particle Swarm Optimization (PSO) and other hybri­dized method PSO with Greedy Randomized Adaptive Search Optimization (PSO-GRASP). Several experiments are performed by using parameters: 1000 maximum iteration and 600 maximum computa­tion time by using four dataset combinations. The results show that CSA can give better performance than PSO but worse than PSO-GRASP.
PEMODELAN DAN PENYELESAIAN PERMASALAHAN PENJADWALAN PILOT DENGAN METODE EKSAK DEKOMPOSISI Rusdiansyah, Ahmad; Mirenani, Yani Dhina; Labiba, Zya; Siswanto, Nurhadi
Jurnal Teknik Industri Vol 9, No 2 (2007): DECEMBER 2007
Publisher : 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.pp. 112-124

Abstract

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
Model of Dynamic Pricing for Two Parallels Flights with Multiple Fare Classes Based on Passenger Choice Behavior Rusdiansyah, Ahmad; Mariana, Dira; Pradana, Hilman; Wessiani, Naning A.
Jurnal Teknik Industri Vol 12, No 1 (2010): JUNE 2010
Publisher : 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.pp. 9-16

Abstract

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.
Model Dynamic Pricinguntuk Penetapan Harga Tiket Pesawat Terbang Berbasis Waktu dan Persediaan Kursi dengan Mempertimbangkan Keputusan Kompetitor Rusdiansyah, Ahmad; Dwi A. P., Rescha; Puspitasari, Nia
Jurnal Teknik Industri Vol 15, No 1 (2013): JUNE 2013
Publisher : Institute of Research and Community Outreach - Petra Christian University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (737.588 KB) | DOI: 10.9744/jti.15.1.45-56

Abstract

In the airline business nowadays the competition between airlinesis very tight. The decision of pricing of an airline will affect significantly the demand and revenue of other airlines. This study develops a model of Airline Revenue Management (ARM). We build an ARM model under competitive environment. The model considers the change of the competitor’s ticket for two parallel flights and should be made based on time and seat inventory. Specifically, we develop a model of dynamic programming to obtain the optimal ticket price based on the remaining seats, the rest of the time, as well as changes in competitors' ticket prices in order to generate maximum revenue expectation. This study conducted a series of numerical experiment scenarios to demonstrate the behavior of the model to the revenue expectation.
A Hybrid Scatter Search Heuristic Algorithm for Solving Cockpit Crew Rostering Rusdiansyah, Ahmad; Musthofa, Danim; Siswanto, Nurhadi; Putri, Maulin Masyito
Jurnal Teknik Industri Vol 20, No 2 (2018): December 2018
Publisher : 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

Abstract

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.
Penentuan Jumlah dan Kombinasi Jenis Kendaraan dengan Saving Heuristik pada Perusahaan Jasa Logistik Pihak Ketiga Rusdiansyah, Ahmad; Aryusamalia, A
Jurnal Teknik Industri Vol 8, No 2 (2007): Agustus
Publisher : Department Industrial Engineering, University of Muhammadiyah Malang

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

Abstract

PT XYZ is company of logistics service of PT CI where this company hold responsible to logistics activity of PT CI that is covering distribution and warehousing. In transportation activity PT XYZ conducted armada outsourcing transport from some transporter every day. A problem faced in this time was truck rent expenses for the delivery of order to store. Hypothesis customer early from this research was if it done consolidation delivery of order customer, hence expected will be yielded to decrease cost rent daily truck which enough significant. At this research, consolidation conducted by developing method of saving heuristic. By using data of customer was same order on February, 10 2006, this research can reduce consumer of truck counted 3 truck and yield cost-saving rent equal to 18.87% from expense of early. This research also design software prototype for daily operational activities in determining used truck.
Pengembangan Rancang Bangun Game Edukasi Logistik "Stowagame" Mengenai Penataan Kontainer Di Bay Kapal Rachman, Hendriyono; Rusdiansyah, Ahmad
Jurnal Teknik Industri Vol 13, No 1 (2012): Februari
Publisher : Department Industrial Engineering, University of Muhammadiyah Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (600.109 KB) | DOI: 10.22219/JTIUMM.Vol13.No1.67-77

Abstract

Development of educational games focuss on the problem occured on bay management, primarily on loading container at ship bay. The loading plan problem in ship bay commonly known as Master Bay Plan Problem (MBPP). The complexity of MBPP can be seen on its constraints, that are container weight, container destination, container size, container type, and the arrangement rule of container. The study case and playing rules in this game development are adjusted to contextual theory and real situation occured in container arrangement at ship bay. The prototype of this game is called StowaGame. StowaGame is a simulation-based educational games related to container arrangement in ship bay. This software are built with the integration of MBPP and entertainment concept. The effectivity of this educational game will be tested by several player. The MBPP concept of each player will be tested before and after playing the game. Paired-t test calculation shows that p-value is less than 0,05. Thus, it can be concluded that the educational game can educate people with container arrangement concept in ship bay.
Model Hub Median Problem Dengan Batasan Travel Time Ibrahim, Faisal; Rusdiansyah, Ahmad
Jurnal Teknik Industri Vol 18, No 1 (2017): Februari
Publisher : Department Industrial Engineering, University of Muhammadiyah Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (366.768 KB) | DOI: 10.22219/JTIUMM.Vol18.No1.1-8

Abstract

This article describes the development of an uncapacitated p-hub median problem model. The established model will be applied in determining the location of the hub. Generally in the median p-hub model problem, it is known that the number of hubs built with the total cost minimization function. In this developed model, there is no limit to the number of hubs and the function of the intended destination is how many hubs are built. The model also looks for where the hub location will be built and which nodes are allocated to each hub. By eliminating the limitation of the number of hubs built, the model adds a total total timeout limit. The numerical experiments are dealing with the model. The solution to solve the model using excel solver. So that it will be designed spread sheet excel appropriate model. In numerical experiments, dummy data representing real systems will be used with the aim of shortening computational time. Numerical experiments are performed in several conditions scenarios. Computational results generate the location of hubs and nodes allocated to each hub with various experimental scenarios.