Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : MATEMATIKA

ANALISIS LINTASAN KRITIS JARINGAN PROYEK DENGAN PENDEKATAN ALJABAR MAX-PLUS Rudhito, Andi; wahyuni, sri; suparwanto, Ari; Susilo, F
MATEMATIKA Vol 12, No 3 (2009): JURNAL MATEMATIKA
Publisher : MATEMATIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (7.559 KB)

Abstract

This paper proposes a method to critical path analysis in the project network using max-plus algebra approach.  The project network would be represented as a matrix over max-plus algebra. The dynamic of the project would be modeled and analyzed using max-plus algebra approach. The critical path analysis consists of determining earliest start time, latest completion time and float time. The finding show that the dynamic of the project is could be modeled in a systems of max-plus linear equations. The earliest start times of every node in the project are the solution of the system. The latest completion times of every node in the project are the solution of the modified system. The float time of every activity in the project could be detemined by modify and do some matrices operation over earliest start time vector and latest completion time vector. An example for modeling and computing a project using MATLAB example show that the result was appropriated with the critical path method (CPM).
SIFAT PERIODIK JARINGAN ANTRIAN SERI TERTUTUP DENGAN PENDEKATAN ALJABAR MAX-PLUS Rudhito, M Andy; Wahyuni, Sri; Suparwanto, Ari; Susilo, Frans
MATEMATIKA Vol 14, No 2 (2011): JURNAL MATEMATIKA
Publisher : MATEMATIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (19.617 KB)

Abstract

  Abstract. This article discussed about the properties of  closed periodic queuing network series susing max-plus algebra. The result showed that the properties of  closed periodic dinamic queuing network series can be determined by using the concept of eigen values ​​and eigen vectors of max-plus matrix in the network model. Through the max-plus eigen vector fundamental, can be determined faster early time departure of customers of departure to the next customer periodically, with a large period of max-plus eigenvalue