2019
DOI: 10.1016/j.swevo.2019.05.006
|View full text |Cite|
|
Sign up to set email alerts
|

Two-level imperialist competitive algorithm for energy-efficient hybrid flow shop scheduling problem with relative importance of objectives

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
28
0
2

Year Published

2019
2019
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 69 publications
(30 citation statements)
references
References 39 publications
0
28
0
2
Order By: Relevance
“…The population size and the maximum iterations are set as the same value to compare the performance of IMOEA/DTL, MOEA/D-MR, SPEA2, and NSGA-II. The parameters of NSGA-II, SPEA2, and MOEA/D-MR are set based on some literature and the trial and error method [31][32][33][34][35]. Moreover, considering the randomness of the evolutionary algorithm, three algorithms are run ten times for each scheduling problem, and the result is the average of ten times.…”
Section: Parameters Settingmentioning
confidence: 99%
“…The population size and the maximum iterations are set as the same value to compare the performance of IMOEA/DTL, MOEA/D-MR, SPEA2, and NSGA-II. The parameters of NSGA-II, SPEA2, and MOEA/D-MR are set based on some literature and the trial and error method [31][32][33][34][35]. Moreover, considering the randomness of the evolutionary algorithm, three algorithms are run ten times for each scheduling problem, and the result is the average of ten times.…”
Section: Parameters Settingmentioning
confidence: 99%
“…The authors of [44] adopted a chance-constrain approach to describe decision-makers' awareness for the total tardiness when minimizing the bi-objective of makespan and energy consumption. The authors of [45] considered the makespan, tardiness, and energy consumption and assumed that the third objective is less important than other ones. The authors of [46] proposed an adaptive multi-objective variable neighborhood search algorithm to solve the no-wait flow shop problem, and the authors of [47] designed a multi-objective grey wolf optimization algorithm to solve the flexible job shop problem.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Optimizing the manufacturing industry's scheduling is a critical approach to improve the indicators for energy and environmental sustainability [6]. One of the common problems in manufacturing industry scheduling is the hybrid flow shop scheduling (HFSS) [7]. HFSS is one of the problems in NP-hard problems, which is also the generalization of the flow shop scheduling problem [8] [9] [10] [11].…”
Section: Introductionmentioning
confidence: 99%
“…Xiang, et al [20] designed a model to solve three-stage HFSS, which involved three machines in stage 1, 2 machines in stage 2, and 3 machines in stage 3 to solve the HFSS problems proposed GA algorithm to find the solutions. Several other algorithms to solve HFSP by considering energy efficiency which has been proposed so far include A-novel Teaching-learning-based Optimization Algorithm [21], two-level imperialist competitive algorithm [7], Particle swarm optimization [22], Genetic Algorithm [23], Lagrangian Relaxation Algorithm [24], and Improved Genetic Algorithm [25].…”
Section: Introductionmentioning
confidence: 99%