Solving Preemptive Single Machine Scheduling with Lovebird Algorithm and Constructive Heuristics for Equal-Length Jobs

Nita Fernanda; Amalia Utamima

doi:10.1016/j.procs.2024.03.005

Solving Preemptive Single Machine Scheduling with Lovebird Algorithm and Constructive Heuristics for Equal-Length Jobs

Nita Fernanda, Amalia Utamima^*

^*Corresponding author for this work

Institut Teknologi Sepuluh Nopember

Research output: Contribution to journal › Conference article › peer-review

Abstract

Scheduling is essential in manufacturing to maintain machinery and increase revenue. Machines that are routinely maintained will boost production, whereas scheduling based on total weighted completion time (TWCT) can improve the performance of production equipment. The Lovebird Algorithm (LBA), Constructive Heuristics (CH), and combination of LBA-CH are used in this study to schedule a single machine with equal processing times. LBA, a population-based algorithm, represents job parts as birds for jobs that can be preempted. The experiments, which used ten jobs divided into dozens of job parts, show that LBA-CH can effectively reduce TWCT compared to CH by 18.16%.

Original language	English
Pages (from-to)	310-317
Number of pages	8
Journal	Procedia Computer Science
Volume	234
DOIs	https://doi.org/10.1016/j.procs.2024.03.005
Publication status	Published - 2024
Event	7th Information Systems International Conference, ISICO 2023 - Washington, United States Duration: 26 Jul 2023 → 28 Jul 2023

Keywords

Efficient Use of Resources
Lovebird Algorithm
Preemptive Single Machine Scheduling
Total Weighted Completion Time

Access to Document

10.1016/j.procs.2024.03.005

Cite this

@article{84725856a588450d8916922b50522345,

title = "Solving Preemptive Single Machine Scheduling with Lovebird Algorithm and Constructive Heuristics for Equal-Length Jobs",

abstract = "Scheduling is essential in manufacturing to maintain machinery and increase revenue. Machines that are routinely maintained will boost production, whereas scheduling based on total weighted completion time (TWCT) can improve the performance of production equipment. The Lovebird Algorithm (LBA), Constructive Heuristics (CH), and combination of LBA-CH are used in this study to schedule a single machine with equal processing times. LBA, a population-based algorithm, represents job parts as birds for jobs that can be preempted. The experiments, which used ten jobs divided into dozens of job parts, show that LBA-CH can effectively reduce TWCT compared to CH by 18.16%.",

keywords = "Efficient Use of Resources, Lovebird Algorithm, Preemptive Single Machine Scheduling, Total Weighted Completion Time",

author = "Nita Fernanda and Amalia Utamima",

note = "Publisher Copyright: {\textcopyright} 2023 The Authors. Published by Elsevier B.V.; 7th Information Systems International Conference, ISICO 2023 ; Conference date: 26-07-2023 Through 28-07-2023",

year = "2024",

doi = "10.1016/j.procs.2024.03.005",

language = "English",

volume = "234",

pages = "310--317",

journal = "Procedia Computer Science",

issn = "1877-0509",

publisher = "Elsevier BV",

}

TY - JOUR

T1 - Solving Preemptive Single Machine Scheduling with Lovebird Algorithm and Constructive Heuristics for Equal-Length Jobs

AU - Fernanda, Nita

AU - Utamima, Amalia

PY - 2024

Y1 - 2024

N2 - Scheduling is essential in manufacturing to maintain machinery and increase revenue. Machines that are routinely maintained will boost production, whereas scheduling based on total weighted completion time (TWCT) can improve the performance of production equipment. The Lovebird Algorithm (LBA), Constructive Heuristics (CH), and combination of LBA-CH are used in this study to schedule a single machine with equal processing times. LBA, a population-based algorithm, represents job parts as birds for jobs that can be preempted. The experiments, which used ten jobs divided into dozens of job parts, show that LBA-CH can effectively reduce TWCT compared to CH by 18.16%.

AB - Scheduling is essential in manufacturing to maintain machinery and increase revenue. Machines that are routinely maintained will boost production, whereas scheduling based on total weighted completion time (TWCT) can improve the performance of production equipment. The Lovebird Algorithm (LBA), Constructive Heuristics (CH), and combination of LBA-CH are used in this study to schedule a single machine with equal processing times. LBA, a population-based algorithm, represents job parts as birds for jobs that can be preempted. The experiments, which used ten jobs divided into dozens of job parts, show that LBA-CH can effectively reduce TWCT compared to CH by 18.16%.

KW - Efficient Use of Resources

KW - Lovebird Algorithm

KW - Preemptive Single Machine Scheduling

KW - Total Weighted Completion Time

UR - http://www.scopus.com/inward/record.url?scp=85193203054&partnerID=8YFLogxK

U2 - 10.1016/j.procs.2024.03.005

DO - 10.1016/j.procs.2024.03.005

M3 - Conference article

AN - SCOPUS:85193203054

SN - 1877-0509

VL - 234

SP - 310

EP - 317

JO - Procedia Computer Science

JF - Procedia Computer Science

T2 - 7th Information Systems International Conference, ISICO 2023

Y2 - 26 July 2023 through 28 July 2023

ER -

Solving Preemptive Single Machine Scheduling with Lovebird Algorithm and Constructive Heuristics for Equal-Length Jobs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this