Browsing by Author "Gamal, M. D. H"

Now showing 1 - 20 of 21
  • No Thumbnail Available
    Item
    ANALISIS ANTRIAN MENGGUNAKAN METODE SIMULASI MONTE CARLO
    (2017-01-12) Lianti, Fajar Etri; Gamal, M. D. H
    This article discusses the analysis of performance measures of patients queuing system using Monte Carlo simulations and The M=G=c=GD=1=1 queuing model. Then do the comparison of system performance measures obtained from both methods with the results obtained from field data. Both methods have slightly different results. Results obtained using the Monte Carlo simulation method is more accurate than the analytical method.
  • No Thumbnail Available
    Item
    ANALISIS PERAMALAN DENGAN MENGGUNAKAN METODE PEMULUSAN EKSPONENSIAL TUNGGAL
    (2016-04-27) Rahmattia, Annisa; Bustami; Gamal, M. D. H
    This article discusses the forecasting method that is used to predict the value of the future. This forecasting uses a single exponential smoothing method which has one smoothing parameter that satis es a value between 0 and 1 obtained through trial and error. Then linear programming is used for determining an optimal smoothing parameter value. This method simply sets the forecast value of future period with a measure of forecasting error using MAE (Mean Absolute Error) and MAPE (Mean Absolute Percentage Error). This forecasting method is implemented in a case of predicting the sale price of bunch of palm at a company in Riau.
  • No Thumbnail Available
    Item
    ANALISIS WAKTU PENJADWALAN PROYEK PEMBANGUNAN RUMAH BERDASARKAN SIMULASI MONTE CARLO
    (2017-01-12) Ramadhan, Rahmiyati Nur; Gamal, M. D. H
    This article discusses the analysis of the scheduling time housing construction projects using Monte Carlo simulation and PERT methods. Both of these methods use a network to facilitate the scheduling of the project. Computational results show that the Monte Carlo simulation is more efficient and effective than PERT method.
  • No Thumbnail Available
    Item
    Applikasi Simulasi Monte Carlo Dan Metode Pert/Cpm Pada Jaringan Kerja: Sebuah Kajian Survei
    (2017-10-16) Gamal, M. D. H; Pratiwi, Erni
    Artikel ini membahas optimisasi penjadwalan proyek pembuatan kapal menggunakan simulasi Monte Carlo dan metode PERT/CPM. Kedua Metode ini menggunakan jaringan kerja untuk memudahkan penjadwalan proyek. Hasil komputasi menunjukkan bahwa penjadwalan proyek menggunakan simulasi Monte Carlo lebih baik daripada metode PERT/CPM.
  • No Thumbnail Available
    Item
    Beberapa Metode untuk Menyelesaikan Program Gol
    (2018-02-19) Safitri, Elfira; Saleh, Habibis; Gamal, M. D. H
    Salah satu teknik penting dalam optimisasi yang sudah dikembangkan adalah Program Gol. Pada tulisan ini dibahas empat metode untuk menyelesaikan program gol yaitu metode simplex yang dimodifikasi, metode simplex yang direvisi, metode preemptif dan metode non-preemptif. Dari keempat metode ini tampak bahwa ada perbedaan dalam proses pivoting variabel yang masuk dan keluar basis. Untuk metode simplex yang dimodifikasi, metode preemptif dan metode non-preemptif disajikan dalam bentuk tabel penuh dengan menghitung nilai penciutannya sedangkan metode simplex yang direvisi menggunakan matriks invers yang berkorespondensi dengan variabel basis
  • No Thumbnail Available
    Item
    KOMBINASI PENAKSIR RASIO DAN PENAKSIR REGRESI UNTUK RATA-RATA POPULASI MENGGUNAKAN MEDIAN DAN KOEFISIEN SKEWNESS PADA SAMPLING ACAK SEDERHANA
    (2014-03-25) Sakinah; Efendi, Rustam; Gamal, M. D. H
    In this artikel the combination of ratio estimators and ratio regression in simple random sampling using median and coefficient of skewness are discussed, which is a review and an expansion from the article J. Subramani & G. Kumarapandiyan [American Journal of Matematics and Statistics, 2(5): 101-107]. The estimators are biased estimators and the mean square errors are determined. Estimator with the smallest mean square error is the most efficient estimator. A numerical example is given at the end of discusssion.
  • No Thumbnail Available
    Item
    KONSTRUKSI PERSAMAAN BLACK-SCHOLES DENGAN KONSEP MODEL PENENTUAN HARGA ASET MODAL
    (2013-07-23) Primades, Jayanti; Kho, Johannes; Gamal, M. D. H
    This article discusses an equation to find an option pricing model, known as Black- Scholes equation. Black-Scholes equation is constructed with the concept of capital asset pricing model. Capital asset pricing model is used to choose the optimum asset in equilibrium market, to get small risks at the asset. European put option model is a solution of non-dividen of Black-Scholes equation by converting Black- Scholes equation into the heat equation. An example of application of Black-Scholes equation is given at the end discussion.
  • No Thumbnail Available
    Item
    Location-Allocation Problems With The Presence Of Barriers
    (2017-10-16) Gamal, M. D. H
    A constructive heuristic is introduced to solve a continuous location-allocation problem in the presence of convex polygonal barriers. Potensial sites for the facility can be anywhere in the space except in the interior of the barriers. Also the Euclidean distance travelled cannot cross the interior of the barriers. The main steps of the method is put forward. The preliminary results is presented based on benchmark problems.
  • No Thumbnail Available
    Item
    MENGOPTIMALKAN WAKTU PENJADWALAN PROYEK PEMBUATAN KAPAL DENGAN SIMULASI MONTE CARLO
    (2017-01-11) Pratiwi, Erni; Gamal, M. D. H
    This article discusses scheduling optimization of shipbuilding projects, using Monte Carlo simulation and methods PERT/CPM. Both of these methods utilize the network to determine the project schedule. Furthermore, research shows that the project scheduling using Monte Carlo simulation is better than the method PERT/CPM.
  • No Thumbnail Available
    Item
    MENYELESAIKAN PERMAINAN DENGAN METODE NILAI SHAPLEY
    (2014-03-25) Saputra, Hendra; Nababan, T. P; Gamal, M. D. H
    We study the Shapley value methods in solving n-person game. It is defined as a characteristic function, which is the player’s coalition form. The optimal strategy of every player is determined by the characteristic function. A numerical example is given at the last of the discussion
  • No Thumbnail Available
    Item
    MENYELESAIKAN PERSOALAN TRANSPORTASI DENGAN KENDALA CAMPURAN
    (2013-03-26) Sari, J. K; Karma, A; Gamal, M. D. H
    A new algorithm of transportation that is more-for-less (MFL) algorithm has been used to solve transportation problems with mixed constraints. The proposed of this transportation problem is to determine how many product that should shipped from each sources to each destination. Hence each demand from each destination can be fulflled with minimum total shipping cost
  • No Thumbnail Available
    Item
    MODEL ECONOMIC PRODUCTION QUANTITY (EPQ) DENGAN PROSES PENGERJAAN ULANG
    (2013-04-19) Faizin, Nur; Nababan, T. P; Gamal, M. D. H
    This paper discusses a method developed by Yuan-Shyi Peter Chiu, Singa Wang Chiu and Hong-Dar Lin [1] to solve EPQ model with reworking process. During the reworking process, shortage is not allowed. Therefore the consument demand’s service level is constant. This model considers the reworking cost of defective item and the time during the reworking process. A numerical example is given at the last discussion
  • No Thumbnail Available
    Item
    MODEL ECONOMIC PRODUCTION QUANTITY KETIKA TERJADI BARANG CACAT DAN KEKURANGAN STOK
    (2014-03-25) Siregar, Juliana; Lily, Endang; Gamal, M. D. H
    This paper discusses Economic Production Quantity (EPQ) model with defective items and shortage, which is a review from the article Krishnamoorthi & Panayappan [International Journal of Management Science and Engineering Management 7(3) (2012): 220-223]. EPQ model discussed is based on defective item condition when shortage is allowed. This model considers the cost incurred for meeting the demand and also considers the fixed time to place a product. Furthermore, a numerical example is given to explain the problem discussed
  • No Thumbnail Available
    Item
    MULTI-FACILITY LOCATION PROBLEMS WITH THE PRESENCE OF BARRIERS
    (2014-05-22) Gamal, M. D. H
    A constructive heuristic method is introduced to solve the multi-facility location problems in the presence of convex polygonal barriers. Potential locations for the facilities can be anywhere in the space except in the interior of the barriers. Also the Euclidean distance travelled cannot cross the interior of the barriers. The method guides the initial chosed location away from the barriers and the Weisgal procedure then improve the location position subject to the user locations and the corner points of the barriers. The preliminary results are presented based on benchmark problems
  • No Thumbnail Available
    Item
    PENDEKATAN BARU UNTUK PENYELESAIAN MASALAH TRANSPORTASI SOLID
    (2016-04-26) Simanjuntak, Siti Agustina; Nababan, Tumpal P; Gamal, M. D. H
    This article discusses the application of new method in the solid transportation problem to minimize the total distribution cost from some sources to some destinations using some conveyances. The minimum total distribution cost using the new approach is optimal and can be obtain easily, quickly and simple way
  • No Thumbnail Available
    Item
    Pendekatan Program Linear Untuk Persoalan Pemotongan Beragam Ukuran Stok
    (2017-10-16) Gamal, M. D. H; Nababan, T.P
    This paper studies a linear programming approach of solving the cutting-stock problems in industries. In this paper, the standard stocks with various lengths is considered and to be cut into various smaller lengths to meet customer’s demand. The objective function of this problem is to minimize the trim loss resulting in cutting the standard lengths, this is equivalent to minimizing the number of stocks used. Column generation method is used to obtain the optimal cutting patterns. Then a small example is presented by using Microsoft Excel as a computational tool.
  • No Thumbnail Available
    Item
    PENYELESAIAN MASALAH TRAVELING SALESMAN DENGAN PEMROGRAMAN DINAMIK
    (2012-10-14) Mustafsiroh; Gamal, M. D. H; Natsir, M.
    Traveling salesman problem ia a problem in graph theory. This problem can be solved by enumurating all possible Hamilton circuit. Then we calculate the length of rute of each circuit, and then we choose the shortest circuit. For a large n, many of Hamilton circuits are examined. We discuss traveling salesman problem using dinamic programming to find optimal solution.
  • No Thumbnail Available
    Item
    PERENCANAAN DIET DIABETES NEFROPATI DENGAN PROGRAM GOL
    (2016-04-27) Muyasiroh, Nurul; Lily, Endang; Gamal, M. D. H
    This article discusses an application of goal programming in a real life case, that is a diet program for a diabetic nefropati patients. Dietitians usually use the food substitute list method in determining the amount of food recommended for the diabetic nefropati patients. A mathematical method that we use is goal programming. The computation of goal programming model is carried out using LINGO. The computational results are quite satisfactory since the amount of nutrients meet the amount of the standard diet.
  • No Thumbnail Available
    Item
    A Rotary Heuristic for Location-Allocation Problems
    (2017-10-16) Gamal, M. D. H
    This paper proposes a constructive heuristic method to solve location-allocation problems. Specifically, we consider the problem of locating m new facilities in a continuous region such that the sum of the weighted distances from the new facilities to n existing facilities is minimized. The distance is measured using the Euclidean-distance metric. This simple technique shows that the solution found is encouraging for the case where the number of users is much larger than the number of facilities to be located
  • No Thumbnail Available
    Item
    Single Facility Location With The Presence Of Barriers
    (2017-10-16) Gamal, M. D. H
    In this study, we are given a set of customers, located at n fixed points, with their respective demands. We are required to locate M facilities in continuous space to serve these n customers, and to find the allocation of these customers to these M facilities. The objective is to minimize the sum of transportation costs. This continuous location-allocation problem is also known as the multi-source Weber problem