Greedy-assisted teaching-learning-based optimization algorithm for cost-based hybrid flow shop scheduling

Production scheduling is a strategic process that organizes the execution of jobs on available resources to optimize specific objectives. One significant scheduling challenge is the Cost-based Hybrid Flow Shop (CHFS) problem, which involves optimizing job scheduling across multiple stages to minimiz...

Full description

Bibliographic Details
Main Authors: Ullah, Wasif, Mohd Fadzil Faisae, Ab Rashid, Muhammad Ammar, Nik Mu’tasim
Format: Article
Language:English
Published: Elsevier 2025
Subjects:
Online Access:http://umpir.ump.edu.my/id/eprint/43975/
http://umpir.ump.edu.my/id/eprint/43975/1/Greedy-assisted%20teaching-learning-based%20optimization%20algorithm%20for%20cost-based%20hybrid%20flow%20shop%20scheduling.pdf
_version_ 1848827003189329920
author Ullah, Wasif
Mohd Fadzil Faisae, Ab Rashid
Muhammad Ammar, Nik Mu’tasim
author_facet Ullah, Wasif
Mohd Fadzil Faisae, Ab Rashid
Muhammad Ammar, Nik Mu’tasim
author_sort Ullah, Wasif
building UMP Institutional Repository
collection Online Access
description Production scheduling is a strategic process that organizes the execution of jobs on available resources to optimize specific objectives. One significant scheduling challenge is the Cost-based Hybrid Flow Shop (CHFS) problem, which involves optimizing job scheduling across multiple stages to minimize scheduling-related costs. However, limited attention has been given to CHFS when considering holistic cost models using efficient algorithms. This paper presents a novel Greedy-Assisted Teaching-Learning-Based Optimization (GTLBO) algorithm for CHFS. Unlike previous studies that focus on isolated cost factors, this research formulated an integrated mathematical model for CHF holistically capturing labor, energy consumption, maintenance, and late penalty costs. The GTLBO algorithm incorporates a unique hybrid initialization strategy, generating 10 % of the initial population using a Greedy algorithm to enhance exploration efficiency. The performance of GTLBO was evaluated through computational experiments involving 12 test instances, with comparative algorithms included for analysis. Results from the Wilcoxon rank-sum test indicated a significant difference between the outputs of GTLBO and other algorithms, with GTLBO outperforming the comparative algorithms in 75 % of the test instances. Additionally, the case study validation showed that GTLBO can reduce costs by 0.23 % to 4.31 % compared to other algorithms. This research offers valuable insights for manufacturers seeking to optimize CHFS scheduling to reduce production expenses.
first_indexed 2025-11-15T03:53:48Z
format Article
id ump-43975
institution Universiti Malaysia Pahang
institution_category Local University
language English
last_indexed 2025-11-15T03:53:48Z
publishDate 2025
publisher Elsevier
recordtype eprints
repository_type Digital Repository
spelling ump-439752025-03-03T07:37:16Z http://umpir.ump.edu.my/id/eprint/43975/ Greedy-assisted teaching-learning-based optimization algorithm for cost-based hybrid flow shop scheduling Ullah, Wasif Mohd Fadzil Faisae, Ab Rashid Muhammad Ammar, Nik Mu’tasim TJ Mechanical engineering and machinery Production scheduling is a strategic process that organizes the execution of jobs on available resources to optimize specific objectives. One significant scheduling challenge is the Cost-based Hybrid Flow Shop (CHFS) problem, which involves optimizing job scheduling across multiple stages to minimize scheduling-related costs. However, limited attention has been given to CHFS when considering holistic cost models using efficient algorithms. This paper presents a novel Greedy-Assisted Teaching-Learning-Based Optimization (GTLBO) algorithm for CHFS. Unlike previous studies that focus on isolated cost factors, this research formulated an integrated mathematical model for CHF holistically capturing labor, energy consumption, maintenance, and late penalty costs. The GTLBO algorithm incorporates a unique hybrid initialization strategy, generating 10 % of the initial population using a Greedy algorithm to enhance exploration efficiency. The performance of GTLBO was evaluated through computational experiments involving 12 test instances, with comparative algorithms included for analysis. Results from the Wilcoxon rank-sum test indicated a significant difference between the outputs of GTLBO and other algorithms, with GTLBO outperforming the comparative algorithms in 75 % of the test instances. Additionally, the case study validation showed that GTLBO can reduce costs by 0.23 % to 4.31 % compared to other algorithms. This research offers valuable insights for manufacturers seeking to optimize CHFS scheduling to reduce production expenses. Elsevier 2025-05-10 Article PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/43975/1/Greedy-assisted%20teaching-learning-based%20optimization%20algorithm%20for%20cost-based%20hybrid%20flow%20shop%20scheduling.pdf Ullah, Wasif and Mohd Fadzil Faisae, Ab Rashid and Muhammad Ammar, Nik Mu’tasim (2025) Greedy-assisted teaching-learning-based optimization algorithm for cost-based hybrid flow shop scheduling. Expert Systems with Applications, 273 (126955). pp. 1-15. ISSN 0957-4174. (In Press / Online First) (In Press / Online First) https://doi.org/10.1016/j.eswa.2025.126955 https://doi.org/10.1016/j.eswa.2025.126955
spellingShingle TJ Mechanical engineering and machinery
Ullah, Wasif
Mohd Fadzil Faisae, Ab Rashid
Muhammad Ammar, Nik Mu’tasim
Greedy-assisted teaching-learning-based optimization algorithm for cost-based hybrid flow shop scheduling
title Greedy-assisted teaching-learning-based optimization algorithm for cost-based hybrid flow shop scheduling
title_full Greedy-assisted teaching-learning-based optimization algorithm for cost-based hybrid flow shop scheduling
title_fullStr Greedy-assisted teaching-learning-based optimization algorithm for cost-based hybrid flow shop scheduling
title_full_unstemmed Greedy-assisted teaching-learning-based optimization algorithm for cost-based hybrid flow shop scheduling
title_short Greedy-assisted teaching-learning-based optimization algorithm for cost-based hybrid flow shop scheduling
title_sort greedy-assisted teaching-learning-based optimization algorithm for cost-based hybrid flow shop scheduling
topic TJ Mechanical engineering and machinery
url http://umpir.ump.edu.my/id/eprint/43975/
http://umpir.ump.edu.my/id/eprint/43975/
http://umpir.ump.edu.my/id/eprint/43975/
http://umpir.ump.edu.my/id/eprint/43975/1/Greedy-assisted%20teaching-learning-based%20optimization%20algorithm%20for%20cost-based%20hybrid%20flow%20shop%20scheduling.pdf