Lely Hiryanto
Fakultas Teknologi Informasi Universitas Tarumanagara Jakarta - Indonesia

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

JOB SHOP SCHEDULING PROBLEM DENGAN ARTIFICIAL IMMUNE SYSTEM Ericko Satyagraha; Lely Hiryanto; Gunadi Gan
Jurnal Ilmu Komputer dan Sistem Informasi Vol 1, No 2 (2013): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v1i2.3126

Abstract

The designed system is a job shop scheduling system using Artificial Immune System (AIS). This system will process each n jobs and every m machines in order to obtain a production schedule that has the smallest total processing time of production (makespans). Tests on the form that is already functioning as expected and where the influence of the size and number of iterations antibody discovery impact the best schedule. Keywords : Artificial Immune System, Antibody, Clone, Mutation, Vactination, Receptor.
IMPLEMENTASI WEB SERVICE UNTUK MOBILE COMMERCE Grimaldi Suryadi; Lely Hiryanto; Bobby Tumbelaka
Jurnal Ilmu Komputer dan Sistem Informasi Vol 1, No 1 (2013): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v1i1.3074

Abstract

E-commerce is currently widely used by companies to offer and provide information that can be in the form of products or services to quickly and accurately. In addition to quick and accurate, the information which stored in database must can be accessed anywhere and anytime. With the growth development of technology, the database can be accessed through mobile devices such as devices with Android operating system via Internet. In accessing the database from another device via Internet needed an interface or bridge that can be used and accessed by a wide variety of programming languages. Bridge or a interface is called a web service. With the existence of these technologies, e-commerce can be evolved into mobile e-commerce. Therefore  2 applications are made to support e-commerce which is web application and mobile application. Both applications show the products in accordance with the database of the company
SISTEM PENJADWALAN MATA KULIAH, PRAKTIKUM, DAN KULIAH PENGGANTI DENGAN METODE ITERATIVE FORWARD SEARCH Nadia Yanitra; Lely Hiryanto
Jurnal Ilmu Komputer dan Sistem Informasi Vol 3, No 1 (2015): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v3i1.3280

Abstract

Class, laboratory, and substitute class application is made by using Iterative Forward Search. This application will deliver optimized schedule of class, laboratory, and substitute class scheduling. The sample case is Faculty of Information Technology at Tarumanagara University. Iterative Forward Search is used to deliver schedule of class, laboratory, and substitute class with consideration of part time lecturer’s time availability, no violation of hard constraint, and as few as possible violation of soft constraint. The results still indicate the violation of soft constraint and the mismatch schedule to part time lecturer’s time availability. The most frequent violation of soft constraint is when two classes; one class is in year x and the other one is in year (x-2) or year (x+2); were scheduled in the same timeslot. The mismatch schedule to part time lecturer’s time availability is caused by violation of hard constraint in the pointed timeslot. Key wordsIterative Forward Search, Fakultas Teknologi Informasi Universitas Tarumanagara, University Course Timetabling Problem
SISTEM PENGELOLAAN KURIKULUM, ABSENSI DOSEN DAN KULIAH PENGGANTI PADA FAKULTAS TEKNOLOGI INFORMASI UNIVERSITAS TARUMANAGARA Yunita Yunita; Lely Hiryanto
Jurnal Ilmu Komputer dan Sistem Informasi Vol 1, No 1 (2013): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v1i1.3099

Abstract

The developed application consist of three parts, curriculum operational manager,lecturer’s absence manager and scheduling of substitute course. The curriculum operational manager is used as a tool to create a computerized curriculum operational’s report. Meanwhile, the lecturer’s absence manager is created to count the absence of the lecturer and generating a lecturer absence recapitulation’s document. The Constraint Based Reasoning Algorithm will be combined with Great Deluge Algorithm to get a suitable room and time slot for the needed substitute course. The application’s testing result’s shows that the system has been able to generate curriculum operatinal’s report and lecturer’s absence report according to the prescribed format. Testing to the substitute course scheduling is conducted on Faculty of  Information Technology Tarumanagara University’s 2012/2013 odd semester’s schedule and the result shows that there was no violation of the provisions of existing substitute course schedule’s rule. 
PERANCANGAN SISTEM PENJADWALAN PRODUKSI MENGGUNAKAN PENGGABUNGAN METODE NEH DAN M-MMAS Rionaldy Trisaputra; Lely Hiryanto, ST., M. Sc
Jurnal Ilmu Komputer dan Sistem Informasi Vol 2, No 1 (2014): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v2i1.3184

Abstract

The designed system is a scheduling production system with a general flow shop. The purpose of this system is to determine the exact sequence work to minimize makespan and mean flow time by using the combination method Nawaz, Enscore & Ham (NEH) and Mix Max-Min Ant System (M-MMAS). The M-MMAS method requires an initial solution that initial sequence determined by NEH method as one of the best heuristic methods to minimize makespan. Afterwards, it’s continued with M-MMAS method. The testing is done by comparing M-MMAS method with enterprise scheduling system. The result of the testing which uses NEH method gives changes in the objective function that is makespan reduction of 3.12% and mean flow time of 5.23% whereas by using M-MMAS method gives makespan reduction of 3.12% and mean flow time of 20.16% of enterprise system currently. Key wordsGeneral Flow Shop, Makespan, Mean Flow Time, Nawaz Enscore and Ham, Mix Max-Min Ant System
APLIKASI PENJADWALAN UJIAN DAN KULIAH PENGGANTI DENGAN METODE ANT COLONY OPTIMIZATION (STUDI KASUS: FTI UNTAR) Vina Tandean; Lely Hiryanto
Jurnal Ilmu Komputer dan Sistem Informasi Vol 2, No 1 (2014): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v2i1.3189

Abstract

An exam and substitute class application is made using Ant Colony Optimization algorithm. FTI Untar is used as a study case in this application development The purpose of using this algorithm is to get a schedule that not break constraints.  The results of the tests done for the courses scheduling of odd semester of 2012 / 2013 until odd semester of 2013 / 2014, there is no hard-constraints (constraints that must be satisfied) violation, but there is a violation of soft constraint. It is also concluded that the average number of students who need to participate in more than one exam at the same time is 23 students. The number of students is an average sum of 5 subjects. After evaluating the existing schedule, it is concluded that the number of students who need to participate in more than one exam at the same time in the generated schedule is higher, but the violation of soft constraints is less. Key wordsAnt Colony Optimization,Exam, Substitute Class, University Timetabling Problem 
SISTEM TERDISTRIBUSI UNTUK COURSE MANAGEMENT SYSTEM (STUDI KASUS : FTI UNTAR) Farenco Farenco; Lely Hiryanto; Bagus Mulyawan
Jurnal Ilmu Komputer dan Sistem Informasi Vol 1, No 1 (2013): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v1i1.3070

Abstract

Distributed Systems for Course Management System is a system designed using the System Development Life Cycle (SDLC) method in order to help activities that related to teaching and learning activities in the Faculty of Information Technology Tarumanagara University. Inside the program, there are several modules, such as student attendance module, online quiz module, and lecture materials processing module. Student attendance module is used to record student attendance, and display it in a report. Course materials processing module is used to process lecture materials so later they can be used as a place to share course materials. Based on the test results, the modules in the program has gone very well and  can be accepted by the faculty. Student attendance module and the student attendance report is able to help faculty and staff departments to record and view student attendance at every teaching and learning activities.
SISTEM PENJADWALAN MATA KULIAH, PRAKTIKUM, DAN KULIAH PENGGANTI DENGAN METODE ITERATIVE FORWARD SEARCH Nadia Yanitra; Lely Hiryanto
Jurnal Ilmu Komputer dan Sistem Informasi Vol 3, No 1 (2015): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v3i1.3281

Abstract

Class, laboratory, and substitute class application is made by using Iterative Forward Search. This application will deliver optimized schedule of class, laboratory, and substitute class scheduling. The sample case is Faculty of Information Technology at Tarumanagara University. Iterative Forward Search is used to deliver schedule of class, laboratory, and substitute class with consideration of part time lecturer’s time availability, no violation of hard constraint, and as few as possible violation of soft constraint. The results still indicate the violation of soft constraint and the mismatch schedule to part time lecturer’s time availability. The most frequent violation of soft constraint is when two classes; one class is in year x and the other one is in year (x-2) or year (x+2); were scheduled in the same timeslot. The mismatch schedule to part time lecturer’s time availability is caused by violation of hard constraint in the pointed timeslot. Key wordsIterative Forward Search, Fakultas Teknologi Informasi Universitas Tarumanagara, University Course Timetabling Problem
Aplikasi Perencanaan Studi Mahasiswa Menggunakan Bayesian Belief Networks (Studi Kasus FTI Untar) Ferryanto Ferryanto; Lely Hiryanto; Dedi Trisnawarman
Jurnal Ilmu Komputer dan Sistem Informasi Vol 1, No 2 (2013): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v1i2.3128

Abstract

The application of student’s itinerary consists of two main part. The first part is recommendation. The recommendation uses bayesian belief networks to classify whether a student might pass or not if they took a certain course. The recommendation will give an alternative itinerary about information regarding which courses, lecturers, and classes to take. This is possible by mining data from previous students with similiar academic achievements. The last but not least part is detection. The function of detection is to detect which students are likely to drop out. This is done by calculating the average total points accumulated for each passing courses, then comparing it with provision of minimum accumulated points from the Faculty of Information Technology. The detection also involves calculation of the average accumulated points terms and comparation whether the students might graduate within the time limit based on the provision. The recommendation using bayesian belief networks proves to be useful by getting 91,24 % accuracy. The high accuracy is likely supported by considerate preprocessing methods and the relationship of each attribute from bayesian belief networks. The detection part is able to detect which students are likely to drop out, for the marked students are students that had drop out before and had a bad academic achievements. Key wordsBayesian belief networks, detection, drop out, recommendation, student’s itinerary.
APLIKASI PERHITUNGAN EFFORT PERANGKAT LUNAK DENGAN METODE PUTNAM’S MODEL Frankie Frankie; Lely Hiryanto; Bobby Tumbelaka
Jurnal Ilmu Komputer dan Sistem Informasi Vol 3, No 1 (2015): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v3i1.3267

Abstract

Computer technology has developed so much in this last few years. It has already been used by everyone in many aspects even in daily life. Computer technology itself is made by hardware and software. Those two parts stands together to form a technology that can be used by everyone. Hardware is kind of tool or device that is used to runs software. Software is a program that has many kinds depends on need. Software itself is built by codes that is written in various programming language. Software helps people in doing their works. Measuring value of a software is not an easy thing, especially to know the effort needed in writing source code. This program is made to calculate the effort estimation of a software. The method used to calculate the effort is Putnam’s Model which used productivity value of many source code as a model. Key wordsEffort Estimation, Software, Putnam’s Model
Co-Authors Alfine Candra Cuaca Anak Agung Gede Sugianthara Andre Widjaya Andri Firnandius Andri Muliawan Ardhytia Satria Nugraha Arnold Pramudita Tjiawi Aurelia Bagus Mulyawan bagus Mulyawan Bobby Tumbelaka Bobby Tumbelaka Brando Dharma Saputra Chairisni Lubis Chandra Wijaya Chandra Wijaya Chandra Wijaya Chintia Yusnita Violetta Darius Andana Haris Dedi Trisnawarman Desi Arisandi Dian Anggraini Cahyaningtyas Dya Erny Herwindiati Dyah Erny Herwindiati Dyah Erny Herwindiati Elizabeth Erlsha Elizabeth Erlsha, Elizabeth Ericko Satyagraha Ericko Satyagraha Farenco Farenco Farenco Farenco Ferryanto Ferryanto Ferryanto Ferryanto Fika Alfiani Frankie Frankie Frankie Frankie, Frankie Fransisca Regina Fransisca Regina, Fransisca Gabriel Fransisco Gabriel Fransisco, Gabriel Grimaldi Suryadi Grimaldi Suryadi Gunadi Gan Gunadi Gan Harprori Patti Irawati Djajadi Irawati Djajadi Isa Iskandar Jacklin Sinthia Thio James Ariel Gunawan James Ariel Gunawan, James Ariel Janson Hendryli Jason Djatmiko Josselyn Sinthia Thio Karendef Karendef Kristianto, Hans Kurniawan Sulianto Lee, Viciano Lina Lina Listovie Cavito Mariana - Mariana Mariana Martono Darsono Martono Darsono Mishelle Tirtajaya Winartha Nadia Yanitra Nadya Yanitra, Nadya Pharadya Ajeng Swari Sukmawati Ratchagit, Manlika Renaldo Ali Renaldo Ali, Renaldo Riki Yohanes Hendriyanto Rionaldy Trisaputra Rosalinda . Rosalinda Rosalinda Satrya N. Ardhytia Stephanie Budianto Stephen Yan Putra Halim, Stephen Yan Putra Stevy Lie Stevy Lie, Stevy Sufisan Sufisan TATI NURHAYATI Teny Handhayani Timothy Reynaldi Tony Tony Tony Tony TRI SUTRISNO Vina Tandean Viny Christanti M Wirawan, Andhika Putra Yunita Yunita Yunita Yunita