Melola Discovery

← Melola Discovery

Jurnal SINTA 2

Optimasi Penjadwalan Pengerjaan Software Pada Software House Dengan Flow-Shop Problem Menggunakan Artificial Bee Colony

Jurnal Teknologi Informasi dan Ilmu Komputer (JTIIK) · Vol. 3 No. 4 (2016) · pp. 259–264

DOI
10.25126/jtiik.201634226
ISSN
2528-6579, 2355-7699
Published
2016-12-26
Publisher
Fakultas Ilmu Komputer, Universitas Brawijaya
Language
en

Abstract

AbstrakPenelitian ini mengusulkan sebuah implementasi terkait optimasi penjadwalan pengerjaan software pada software house dengan Flow-Shop Problem (FSP) menggunakan algoritma Artificial Bee Colony (ABC). Dimana dalam FSP dibutuhkan suatu solusi untuk menyelesaikan suatu job/task dengan meminimalkan total cost yang dikeluarkan. Terdapat constraint yang perlu diperhatikan dalam objek permasalahan penelitian ini, yaitu lama waktu penyelesaian keseluruhan projek software yang tidak pasti. Dalam penelitian ini akan disusun sebuah representasi solusi yaitu berupa urutan pengerjaan projek dengan total waktu pengerjaan yang minimum. Pengujian akan dilakukan dengan tiga kali percobaan untuk setiap kondisi uji coba, yaitu uji coba batas parameter iterasi dan uji coba batas parameter limit. Dari hasil pengujian didapatkan bahwa penggunaan algoritma yang dibahas dalam penelitian ini bisa mengurangi waktu pengerjaan jika jumlah iterasi dan jumlah colony diperbesar.Kata kunci: optimasi, flow-shop problem, artificial bee colony, swarm intelligence, meta-heuristik.AbstractThis research proposed an implementation related to software execution scheduling process at a software house with Flow-Shop Problem (FSP) using Artificial Bee Colony (ABC) algorithm. Which in FSP required a solution to complete some job/task along with its overall cost at a minimum. There is a constraint that should be kept to note in this research, that is the uncertainty completion time of its jobs. In this research, we will present a solution that is a sequence order of project execution with its overall completion time at a minimum. An experiment will be performed with 3 attempts on each experiment conditions, that is an experiment of iteration parameter and experiment of limit parameter. From this experiment, we concluded that the use of this algorithm explained in this paper can reduce project execution time if we increase the value of total iteration and total colony.Keywords: optimization, flow-shop problem, artificial bee colony, swarm intelligence, meta-heuristic.

Collaboration network of the authors

40 authors · 109 co-authorship links · 3 across different organisations · showing the 40 most connected

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • University of Brawijaya
  • Universitas Amikom Purwokerto
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Arief Andy SoebrotoUniversity of Brawijaya3
Listiya SurtiningsihUniversity of Brawijaya3
Mochammad Ainun NajibUniversity of Brawijaya3
Handika Agus FauziUniversity of Brawijaya3
Sutrisno .Affiliation unknown2
Nurul HidayatUniversity of Brawijaya2
Canny Amerilyse CaesarUniversity of Brawijaya2
Latifah HanumUniversity of Brawijaya2
Fitra Abdurrachman BachtiarUniversity of Brawijaya2
Candra DewiUniversity of Brawijaya2
Lailil MuflikhahUniversity of Brawijaya2
Muhammad SyafiqUniversity of Brawijaya2
Achmad Jafar Al KadafiUniversity of Brawijaya2
Rizka Husnun ZakiyyahUniversity of Brawijaya2
Wanda Athira LuqyanaUniversity of Brawijaya2
Ahmad Afif SupiantoUniversity of Brawijaya1
Randy Cahya WihandikaUniversity of Brawijaya1
Maria Tenika FrestantiyaUniversity of Brawijaya1
Ziya El AriefUniversity of Brawijaya1
Rina ChristantiUniversity of Brawijaya1
Alfian HimawanUniversity of Brawijaya1
Budi Darma SetiawanUniversity of Brawijaya1
Rekyan Regasari Mardi PutriUniversity of Brawijaya1
Uswatun HasanahUniversitas Amikom Purwokerto1
Lintang Resita MayangsariUniversity of Brawijaya1
Andhica PratamaUniversity of Brawijaya1
Sutrisno SutrisnoUniversity of Brawijaya1
Maryamah .University of Brawijaya1
Moh. Fadel AsikinUniversity of Brawijaya1
Daisy KurniawatyUniversity of Brawijaya1
Selly Kurnia SariUniversity of Brawijaya1
Agnes Rossi Trisna LestariUniversity of Brawijaya1
Umi RofiqohUniversity of Brawijaya1
Siti RobbanaUniversity of Brawijaya1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://jtiik.ub.ac.id/index.php/jtiik/en/oai, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id">Optimasi Penjadwalan Pengerjaan Software Pada Software House Dengan Flow-Shop Problem Menggunakan Artificial Bee Colony</dc:title>
	<dc:creator xml:lang="en">Fhadli, Muhammad</dc:creator>
	<dc:creator xml:lang="en">Jauhari, Daneswara</dc:creator>
	<dc:creator xml:lang="en">Prabowo, Dhimas Anjar</dc:creator>
	<dc:creator xml:lang="en">Hanafi, Anang</dc:creator>
	<dc:creator xml:lang="en">Sunaryo, Aryeswara</dc:creator>
	<dc:creator xml:lang="en">Cholissodin, Imam</dc:creator>
	<dc:description xml:lang="id">AbstrakPenelitian ini mengusulkan sebuah implementasi terkait optimasi penjadwalan pengerjaan software pada software house dengan Flow-Shop Problem (FSP) menggunakan algoritma Artificial Bee Colony (ABC). Dimana dalam FSP dibutuhkan suatu solusi untuk menyelesaikan suatu job/task dengan meminimalkan total cost yang dikeluarkan. Terdapat constraint yang perlu diperhatikan dalam objek permasalahan penelitian ini, yaitu lama waktu penyelesaian keseluruhan projek software yang tidak pasti. Dalam penelitian ini akan disusun sebuah representasi solusi yaitu berupa urutan pengerjaan projek dengan total waktu pengerjaan yang minimum. Pengujian akan dilakukan dengan tiga kali percobaan untuk setiap kondisi uji coba, yaitu uji coba batas parameter iterasi dan uji coba batas parameter limit. Dari hasil pengujian didapatkan bahwa penggunaan algoritma yang dibahas dalam penelitian ini bisa mengurangi waktu pengerjaan jika jumlah iterasi dan jumlah colony diperbesar.Kata kunci: optimasi, flow-shop problem, artificial bee colony, swarm intelligence, meta-heuristik.AbstractThis research proposed an implementation related to software execution scheduling process at a software house with Flow-Shop Problem (FSP) using Artificial Bee Colony (ABC) algorithm. Which in FSP required a solution to complete some job/task along with its overall cost at a minimum. There is a constraint that should be kept to note in this research, that is the uncertainty completion time of its jobs. In this research, we will present a solution that is a sequence order of project execution with its overall completion time at a minimum. An experiment will be performed with 3 attempts on each experiment conditions, that is an experiment of iteration parameter and experiment of limit parameter. From this experiment, we concluded that the use of this algorithm explained in this paper can reduce project execution time if we increase the value of total iteration and total colony.Keywords: optimization, flow-shop problem, artificial bee colony, swarm intelligence, meta-heuristic.</dc:description>
	<dc:publisher xml:lang="en">Fakultas Ilmu Komputer, Universitas Brawijaya</dc:publisher>
	<dc:date>2016-12-26</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://jtiik.ub.ac.id/index.php/jtiik/article/view/226</dc:identifier>
	<dc:identifier>10.25126/jtiik.201634226</dc:identifier>
	<dc:source xml:lang="id">Jurnal Teknologi Informasi dan Ilmu Komputer; Vol 3 No 4: Desember 2016; 259-264</dc:source>
	<dc:source xml:lang="en">Jurnal Teknologi Informasi dan Ilmu Komputer; Vol. 3 No. 4: Desember 2016; 259-264</dc:source>
	<dc:source>2528-6579</dc:source>
	<dc:source>2355-7699</dc:source>
	<dc:source>10.25126/jtiik.201634</dc:source>
	<dc:language>en</dc:language>
	<dc:relation>https://jtiik.ub.ac.id/index.php/jtiik/article/view/226/pdf</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2017 Jurnal Teknologi Informasi dan Ilmu Komputer</dc:rights>
</oai_dc:dc>