2018
DOI: 10.1007/s10845-017-1385-4
|View full text |Cite
|
Sign up to set email alerts
|

Two-agent stochastic flow shop deteriorating scheduling via a hybrid multi-objective evolutionary algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
38
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 81 publications
(38 citation statements)
references
References 47 publications
0
38
0
Order By: Relevance
“…It can solve the narrow pulse problem and simplify the commutation process. In addition, we demonstrate the effectiveness and superiority of the proposed CCFMT to suppress EMI of TSMC on TSMC experiment platform [30][31][32][33][34][35]. Figure 1 shows the topology of TSMC with 18 switches.…”
Section: Introductionmentioning
confidence: 91%
See 1 more Smart Citation
“…It can solve the narrow pulse problem and simplify the commutation process. In addition, we demonstrate the effectiveness and superiority of the proposed CCFMT to suppress EMI of TSMC on TSMC experiment platform [30][31][32][33][34][35]. Figure 1 shows the topology of TSMC with 18 switches.…”
Section: Introductionmentioning
confidence: 91%
“…From the perspective of time domain analysis, the PWM pulse is formed by the pulse connection of different switching moments of a certain width [29][30][31][32]. The CCFMT is such that the carrier period changes with the modulation signal, resulting in a change of the switching time; from the perspective of frequency domain analysis, the PWM pulse is composed of discrete harmonics with fixed fundamental amplitude and frequency.…”
Section: Since the Modulation Function Of Phase B Lags The Phase A Bymentioning
confidence: 99%
“…integrate process planning and scheduling problem [29] and network design problem [30]. Comparison results demonstrate its strong ability in searching for a global optimum, which motivates us to choose it as an optimizer for the investigated problem [31,32].…”
Section: The Proposed H-np Methodsmentioning
confidence: 99%
“…Here, the MOJSSP aims to find an order to optimize the above two objectives simultaneously. The constraints include each job should be processed on only one machine at a time, each machine can process only one job at a time, and the preemption is not allowed [33].…”
Section: Problem Description and Goalmentioning
confidence: 99%