Scheduling a Many-Objective Energy-Efficient Hybrid Flow Shop with Variable Machine Speeds

In the context of promoting sustainable development through green manufacturing, energy-efficient hybrid flow shop scheduling problem (EHFSP) has gained significant attention. However, many-objective energy-efficient hybrid flow shop scheduling problem (MaOEHFSP) is neglected. This paper addresses a MaOEHFSP with variable machine speeds where total energy consumption, makespan, maximum machine load and total machine load are optimized simultaneously and a novel imperia-list competitive algorithm (NICA) is proposed. In NICA, a new assimilation is designed to enhance the diversity of population, a novel revolution is proposed to fully utilize computing resource and an imperialist competition with multiple transfers of colonies is also developed to change the structure of empires. Extensive experiments are conducted by comparing with other algorithms, and the results validate that NICA is superior to others in solving MaOEHFSP.

Authors

Institutions

Publication Details

Published
2024-12-20
DOI
https://doi.org/10.1109/aiac63745.2024.10899630
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scheduling a Many-Objective Energy-Efficient Hybrid Flow Shop with Variable Machine Speeds

Xiaoyi Duan, Ming Lib
Scheduling and Optimization Algorithms
article

Scheduling a Many-Objective Energy-Efficient Hybrid Flow Shop with Variable Machine Speeds

Xiaoyi Duan, Ming Lib
article en

Abstract

In the context of promoting sustainable development through green manufacturing, energy-efficient hybrid flow shop scheduling problem (EHFSP) has gained significant attention. However, many-objective energy-efficient hybrid flow shop scheduling problem (MaOEHFSP) is neglected. This paper addresses a MaOEHFSP with variable machine speeds where total energy consumption, makespan, maximum machine load and total machine load are optimized simultaneously and a novel imperia-list competitive algorithm (NICA) is proposed. In NICA, a new assimilation is designed to enhance the diversity of population, a novel revolution is proposed to fully utilize computing resource and an imperialist competition with multiple transfers of colonies is also developed to change the structure of empires. Extensive experiments are conducted by comparing with other algorithms, and the results validate that NICA is superior to others in solving MaOEHFSP.

Macau University of Science and Technology (MO), Anhui Polytechnic University (CN)
Affordable and clean energy
Openalex Percentile: Top 59%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Scheduling a Many-Objective Energy-Efficient Hybrid Flow Shop with Variable Machine Speeds — Xiaoyi Duan, Ming Lib · (2024) | TGRS Research Map | TGRS