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

A hybrid estimation of distribution algorithm for simulation-based scheduling in a stochastic permutation flowshop

Abstract: The permutation flowshop scheduling problem (PFSP) is NP-complete and tends to be more complicated when considering stochastic uncertainties in the real-world manufacturing environments. In this paper, a two-stage simulation-based hybrid estimation of distribution algorithm (TSSB-HEDA) is presented to schedule the permutation flowshop under stochastic processing times. To deal with processing time uncertainty, TSSB-HEDA evaluates candidate solutions using a novel two-stage simulation model (TSSM). This model f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(14 citation statements)
references
References 48 publications
0
14
0
Order By: Relevance
“…In the literature on stochastic scheduling, various types of probability distributions for stochastic processing times have been studied, such as exponential distribution [3], normal distribution [30,31] and uniform distribution [25]. One method is to treat both the stochastic processing time and the scheduling objective as the stochastic variables, which aims at providing the processing ordering of the tasks on the machines with an expected optimization model.…”
Section: Problem Description and Analysismentioning
confidence: 99%
“…In the literature on stochastic scheduling, various types of probability distributions for stochastic processing times have been studied, such as exponential distribution [3], normal distribution [30,31] and uniform distribution [25]. One method is to treat both the stochastic processing time and the scheduling objective as the stochastic variables, which aims at providing the processing ordering of the tasks on the machines with an expected optimization model.…”
Section: Problem Description and Analysismentioning
confidence: 99%
“…In this research, each factor has three levels: Psize (30,50,80),  % (10%, 20%, 30%), and a s (10%, 20%, 30%).…”
Section: Parameter Calibration Of Edamentioning
confidence: 99%
“…In this research, each factor has three levels: Psize (30,50,80), η% (10%, 20%, 30%), and a s (10%, 20%, 30%).…”
Section: Parameter Calibration Of Edamentioning
confidence: 99%
“…A large number of research groups have paid efforts to improve the performance of EDA algorithm [47][48][49]. The algorithm has been successfully applied to solve flow shop scheduling problems [50][51][52] and flexible flow shop scheduling problems, and it has obtained promising scheduling results. For its advantages, EDA is used to solve the energy-efficient scheduling problems in flexible flow shops in this paper.…”
Section: Eda Algorithmmentioning
confidence: 99%