2020
DOI: 10.1016/j.cie.2020.106431
|View full text |Cite
|
Sign up to set email alerts
|

An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 36 publications
(12 citation statements)
references
References 66 publications
0
12
0
Order By: Relevance
“…In the same manufacturing context, total energy consumption and the total tardiness were considered as objective functions and three metaheuristic algorithms (an ant colony algorithm, a genetic algorithm, and a genetic algorithm with local search) are provided in [73].…”
Section: Permutation Flow Shopmentioning
confidence: 99%
“…In the same manufacturing context, total energy consumption and the total tardiness were considered as objective functions and three metaheuristic algorithms (an ant colony algorithm, a genetic algorithm, and a genetic algorithm with local search) are provided in [73].…”
Section: Permutation Flow Shopmentioning
confidence: 99%
“…One may also find the just-in-time variant, where operations within jobs have due dates and where completing an operation either early or late leads to a penalty [10]. Some other examples include the works of [11]- [14].…”
Section: Index Termsmentioning
confidence: 99%
“…We now focus on altering the objective function to search for instances that favor or hinder a given heuristic, but up to a desired degree. So, we use Equation (14) and Equation ( 15) respectively. Striving for a broader analysis, we execute tests for both sets of previously obtained parameters.…”
Section: Bounded Instancesmentioning
confidence: 99%
“…Huang [15] proposed a new and concise Four-Tuple Scheme (FTS) for modelling a job with operation and processing flexibility and an enhanced GA through a more efficient encoding strategy. Yüksel [16] proposed a novel multiobjective discrete artificial bee colony algorithm (MO-DABC), a traditional multiobjective genetic algorithm (MO-GA), and a variant of multiobjective GA with a local search (MO-GALS) for the biobjective no-wait permutation flow-shop scheduling problem. Wu [17] considered an energy-efficient biobjective no-wait permutation flow-shop scheduling problem in the presence of dynamic speed-scaling technique to minimize makespan and total energy consumption through the proposed AM-VNS works by operating some local search on the solutions in WS and updating the corresponding AS iteratively.…”
Section: Introductionmentioning
confidence: 99%
“…Finally, the conclusions of this paper and future research work are given. [14] Flexible job shop Makespan and total setup time NSGAII Huang [15] Flexible job shop Makespan GA Wang [18] Dynamic job shop Makespan PSO Nagano [8] No-wait flow shop Makespan Iterated greedy algorithm Ali [11] No-wait flow shop Total tardiness SA Yüksel [16] No-wait permutation flow shop Total tardiness and energy consumption ABC and NSGAII Wu [17] No-wait permutation flow shop Makespan and energy consumption Multiobjective VNS Dong [19] No-wait two-stage flow shop Makespan Linear-time combinatorial algorithm Xu [20] No-wait permutation flow shop Makespan Self-adaptive memetic algorithm Ying [3,21,30] No-wait job shop Makespan Multistart SA Deng [22] No-wait job shop Total flow time Iterated greedy algorithm Shi [7] Assembly job shop Makespan GA Lei [23] Integrated scheduling problem Makespan GA Zhao [29] Integrated scheduling problem Makespan GA…”
Section: Introductionmentioning
confidence: 99%