产品待办事项婚礼应用策划(Wepplan)活动中的Scrum框架和贪心算法

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}
引用次数: 0

摘要

抽象地说——技术越发达,所需的需求就越多,这可能是一个被利用来支持技术发展的机会。本研究将其中一个模型应用于应用程序的设计,同时对资产累计的婚礼应用程序程序程序(Wepplan)执行严格的框架和Greedy算法。这就形成了271个小时的工作时间,23个产品积压活动被分成4个短跑,为每个开发人员分配工作时间的问题提供了最佳解决方案。结果是开发商1得到了70小时的工作时间,开发商2:68小时的工作时间,开发商3:69个工作时间,开发商4:64个工作时间。在对应用程序响应时间的价值,结果最快的测试测试测试列表:27386 (s),测试登录15.378 (s),测试婚礼:订婚25841 24433 (s),和测试,测试(s)获得使用katalon,名单上的测试场地:26104 (s),测试餐饮29244 (s),测试充值:26617 (s),编辑和测试简介:使用Testproject 27239 (s)。总结这项研究可能会给开发人员带来特别的好处,让他们在开发应用产品时能定期安排工作时间。关键词——Wepplan, Android, Scrum框架,贪婪算法。抽象的发展——技术的发展,更需要的是一个可以用来支持技术发展的机会。在这项研究中,应用程序中的模型之一是由婚礼应用程序Planner的Scrum框架和Greedy算法实现的。其中271小时的工作时间是由23个产品的最佳提供解决方案组成的结果显示,我们开发了1到70小时的工作时间,开发了2:68小时的工作时间,开发了3:69小时的工作时间,开发了4:64小时的工作时间。在测试应用程序的响应时间价值,the fastest results on the List注册测试:测试27,386 (s),登录测试15,378 (s),婚礼测试:24,433 (s),和一次重要测试用Katalon 25.842 (s)是获得,而在会场26,104 (s),餐饮测试:测试29,244 (s),充值测试:26,617 (s),和资料更新测试:用Testproject 27,239 (s)。这一研究可以提供福利,特别是开发人员为大楼应用产品的设计分配工作时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
40
审稿时长
4 weeks
期刊最新文献
Implementation of the Multimedia Development Life Cycle in Making Educational Games About Indonesia Data Mining Algorithm Decision Tree Itterative Dechotomiser 3 (ID3) for Classification of Stroke Implementation of Weight Aggregated Sum Product Assessment (WASPAS) on the Selection of Online English Course Platforms Usability of Brain Tumor Detection Using the DNN (Deep Neural Network) Method Based on Medical Image on DICOM Performance Comparison Analysis of Multi Prime RSA and Multi Power RSA
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1