A Pareto-optimality based black widow spider algorithm for energy efficient flexible job shop scheduling problem considering new job insertion

Akram, Kashif; Bhutta, Muhammad Usman; Butt, Shahid Ikramullah; Jaffery, Syed Husain Imran; Khan, Mushtaq; Khan, Alam Zeb; Faraz, Zahid

doi:10.1016/j.asoc.2024.111937

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Preprint1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 90 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Multi-objective scheduling for an energy-efficient flexible job shop problem with peak power constraint

Wang,

Wu,

Peng

2024

Applied Soft Computing

View full text Add to dashboard Cite

Multi-objective scheduling for an energy-efficient flexible job shop problem with peak power constraint

Wang,

Wu,

Peng

2024

Applied Soft Computing

View full text Add to dashboard Cite

Research on the Improvement of Bacterial Foraging Algorithm for Flexible Job shop Scheduling Problem

Wang,

Wang

2024

Preprint

View full text Add to dashboard Cite

Machine workload is an important factor to be considered in flexible job shop scheduling, and the existing research has achieved certain results in optimizing the total workload and the maximum machine workload, but the workload balancing among machines is insufficiently considered, the workload imbalance will lead to problems such as underutilization of production potential and machine overload failure. Therefore, this paper first proposes a flexible job shop scheduling problem that considers workload balancing, and an optimization model was established with the goal of minimizing the maximum completion time(Makespan) and minimizing the workload balancing factor, aiming to fully unleash the production potential while avoiding machine overload and further improve the production efficiency. In order to effectively solve the proposed problem, a series of improvements were made to optimize the defects of the bacterial foraging optimization algorithm(BFOA), such as easy to precocious convergence and the “escape” of elite individuals, an improved bacterial foraging optimization algorithm(IBFOA) was proposed. The proposed algorithm designs and introduces Logistic-Circle chaos mapping to enhance the quality of the initial population;An adaptive dynamic step size is designed to ensure the optimization efficiency and accuracy; Improved reproduction operation to avoid precocious convergence; An adaptive migration probability is designed to avoid the "escape" of elite individuals. The results of the case testing show the effectiveness of the proposed model and the superiority of the improved algorithm.

show abstract

A Pareto-optimality based black widow spider algorithm for energy efficient flexible job shop scheduling problem considering new job insertion

Cited by 2 publications

References 90 publications

Multi-objective scheduling for an energy-efficient flexible job shop problem with peak power constraint

Multi-objective scheduling for an energy-efficient flexible job shop problem with peak power constraint

Research on the Improvement of Bacterial Foraging Algorithm for Flexible Job shop Scheduling Problem

Contact Info

Product

Resources

About