Muhamad Iqbal Wasta Purnama, Fauziah Fauziah, Ira Diana Sholihati
{"title":"产品待办事项婚礼应用策划(Wepplan)活动中的Scrum框架和贪心算法","authors":"Muhamad Iqbal Wasta Purnama, Fauziah Fauziah, Ira Diana Sholihati","doi":"10.24114/cess.v7i1.30625","DOIUrl":null,"url":null,"abstract":"Abstrak—Semakin berkembangnya teknologi maka semakin banyaknya kebutuhan yang diperlukan ini bisa menjadi peluang yang mampu dimanfaatkan untuk mendukung suatu pengembangan teknologi. Pada penelitian ini menerapkan salah satu model dalam perancangan aplikasi dengan mengimplementasikan Scrum framework dan Algoritma Greedy pada aktivitas product backlog Wedding Application Planner (Wepplan). Dimana hal tersebut membentuk 271 jam waktu kerja pada 23 aktivitas product backlog yang terbagi menjadi 4 sprint dengan memberikan solusi optimal pada permasalahan penjadwalan pembagian waktu kerja masing-masing developer. Hasil yang didapat yaitu developer 1 mendapatkan 70 jam waktu kerja, developer 2: 68 jam waktu kerja, developer 3: 69 jam waktu kerja, dan developer 4: 64 jam waktu kerja dalam pengerjaannya. Pada pengujian terhadap nilai response time aplikasi, hasil tercepat pada daftar uji Test Daftar: 27.386 (s), Test Login: 15.378 (s), Test Wedding: 24.433 (s), dan Test Engagement 25.841 (s) didapat menggunakan katalon, pada daftar uji Test Venue: 26.104 (s), Test Catering: 29.244 (s), Test Top Up: 26.617 (s), dan Test Edit Profile: 27.239 (s) menggunakan Testproject. Disimpulkan penelitian ini dapat memberikan manfaat terutama kepada para developer untuk mengefisiensi penjadwalan waktu kerja terhadap rancangan aktivitas dalam membangun sebuah produk aplikasi.Kata Kunci—Wepplan, Android, Scrum Framework, Algoritma Greedy. Abstract—Development of a technology, the more needs that are needed this can be an opportunity that can be used to support a technology development. In this study, one of the models in application design is implemented by Scrum framework and Greedy Algorithm in the Wedding Application Planner (Wepplan) product backlog activity. Where this forms 271 hours of work time on 23 product backlog activities which are divided into 4 sprints by providing optimal solutions to the scheduling problem of each developer's work time division. The results obtained are developer 1 gets 70 hours of work time, developer 2: 68 hours of work time, developer 3: 69 hours of work time, and developer 4: 64 hours of work time in the process. In testing the application response time value, the fastest results on the Test List Signup Test: 27,386 (s), Login Test: 15,378 (s), Wedding Test: 24,433 (s), and Engagement Test 25,842 (s) were obtained using Katalon, while in Venue Test: 26,104 (s), Catering Test: 29,244 (s), Top Up Test: 26,617 (s), and Profile Update Test: 27,239 (s) using Testproject. It is concluded that this research can provide benefits, especially for developers to make work time scheduling efficient for the design of activities in building an application product.","PeriodicalId":53361,"journal":{"name":"CESS Journal of Computer Engineering System and Science","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Scrum Framework and Greedy Algorithm in Product Backlog Wedding Application Planner (Wepplan) Activities\",\"authors\":\"Muhamad Iqbal Wasta Purnama, Fauziah Fauziah, Ira Diana Sholihati\",\"doi\":\"10.24114/cess.v7i1.30625\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstrak—Semakin berkembangnya teknologi maka semakin banyaknya kebutuhan yang diperlukan ini bisa menjadi peluang yang mampu dimanfaatkan untuk mendukung suatu pengembangan teknologi. Pada penelitian ini menerapkan salah satu model dalam perancangan aplikasi dengan mengimplementasikan Scrum framework dan Algoritma Greedy pada aktivitas product backlog Wedding Application Planner (Wepplan). Dimana hal tersebut membentuk 271 jam waktu kerja pada 23 aktivitas product backlog yang terbagi menjadi 4 sprint dengan memberikan solusi optimal pada permasalahan penjadwalan pembagian waktu kerja masing-masing developer. Hasil yang didapat yaitu developer 1 mendapatkan 70 jam waktu kerja, developer 2: 68 jam waktu kerja, developer 3: 69 jam waktu kerja, dan developer 4: 64 jam waktu kerja dalam pengerjaannya. Pada pengujian terhadap nilai response time aplikasi, hasil tercepat pada daftar uji Test Daftar: 27.386 (s), Test Login: 15.378 (s), Test Wedding: 24.433 (s), dan Test Engagement 25.841 (s) didapat menggunakan katalon, pada daftar uji Test Venue: 26.104 (s), Test Catering: 29.244 (s), Test Top Up: 26.617 (s), dan Test Edit Profile: 27.239 (s) menggunakan Testproject. Disimpulkan penelitian ini dapat memberikan manfaat terutama kepada para developer untuk mengefisiensi penjadwalan waktu kerja terhadap rancangan aktivitas dalam membangun sebuah produk aplikasi.Kata Kunci—Wepplan, Android, Scrum Framework, Algoritma Greedy. Abstract—Development of a technology, the more needs that are needed this can be an opportunity that can be used to support a technology development. In this study, one of the models in application design is implemented by Scrum framework and Greedy Algorithm in the Wedding Application Planner (Wepplan) product backlog activity. Where this forms 271 hours of work time on 23 product backlog activities which are divided into 4 sprints by providing optimal solutions to the scheduling problem of each developer's work time division. The results obtained are developer 1 gets 70 hours of work time, developer 2: 68 hours of work time, developer 3: 69 hours of work time, and developer 4: 64 hours of work time in the process. In testing the application response time value, the fastest results on the Test List Signup Test: 27,386 (s), Login Test: 15,378 (s), Wedding Test: 24,433 (s), and Engagement Test 25,842 (s) were obtained using Katalon, while in Venue Test: 26,104 (s), Catering Test: 29,244 (s), Top Up Test: 26,617 (s), and Profile Update Test: 27,239 (s) using Testproject. It is concluded that this research can provide benefits, especially for developers to make work time scheduling efficient for the design of activities in building an application product.\",\"PeriodicalId\":53361,\"journal\":{\"name\":\"CESS Journal of Computer Engineering System and Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CESS Journal of Computer Engineering System and Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24114/cess.v7i1.30625\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CESS Journal of Computer Engineering System and Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24114/cess.v7i1.30625","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scrum Framework and Greedy Algorithm in Product Backlog Wedding Application Planner (Wepplan) Activities
Abstrak—Semakin berkembangnya teknologi maka semakin banyaknya kebutuhan yang diperlukan ini bisa menjadi peluang yang mampu dimanfaatkan untuk mendukung suatu pengembangan teknologi. Pada penelitian ini menerapkan salah satu model dalam perancangan aplikasi dengan mengimplementasikan Scrum framework dan Algoritma Greedy pada aktivitas product backlog Wedding Application Planner (Wepplan). Dimana hal tersebut membentuk 271 jam waktu kerja pada 23 aktivitas product backlog yang terbagi menjadi 4 sprint dengan memberikan solusi optimal pada permasalahan penjadwalan pembagian waktu kerja masing-masing developer. Hasil yang didapat yaitu developer 1 mendapatkan 70 jam waktu kerja, developer 2: 68 jam waktu kerja, developer 3: 69 jam waktu kerja, dan developer 4: 64 jam waktu kerja dalam pengerjaannya. Pada pengujian terhadap nilai response time aplikasi, hasil tercepat pada daftar uji Test Daftar: 27.386 (s), Test Login: 15.378 (s), Test Wedding: 24.433 (s), dan Test Engagement 25.841 (s) didapat menggunakan katalon, pada daftar uji Test Venue: 26.104 (s), Test Catering: 29.244 (s), Test Top Up: 26.617 (s), dan Test Edit Profile: 27.239 (s) menggunakan Testproject. Disimpulkan penelitian ini dapat memberikan manfaat terutama kepada para developer untuk mengefisiensi penjadwalan waktu kerja terhadap rancangan aktivitas dalam membangun sebuah produk aplikasi.Kata Kunci—Wepplan, Android, Scrum Framework, Algoritma Greedy. Abstract—Development of a technology, the more needs that are needed this can be an opportunity that can be used to support a technology development. In this study, one of the models in application design is implemented by Scrum framework and Greedy Algorithm in the Wedding Application Planner (Wepplan) product backlog activity. Where this forms 271 hours of work time on 23 product backlog activities which are divided into 4 sprints by providing optimal solutions to the scheduling problem of each developer's work time division. The results obtained are developer 1 gets 70 hours of work time, developer 2: 68 hours of work time, developer 3: 69 hours of work time, and developer 4: 64 hours of work time in the process. In testing the application response time value, the fastest results on the Test List Signup Test: 27,386 (s), Login Test: 15,378 (s), Wedding Test: 24,433 (s), and Engagement Test 25,842 (s) were obtained using Katalon, while in Venue Test: 26,104 (s), Catering Test: 29,244 (s), Top Up Test: 26,617 (s), and Profile Update Test: 27,239 (s) using Testproject. It is concluded that this research can provide benefits, especially for developers to make work time scheduling efficient for the design of activities in building an application product.