2011
DOI: 10.4028/www.scientific.net/amr.189-193.2746
|View full text |Cite
|
Sign up to set email alerts
|

A New Hybrid Particle Swarm Optimization for Solving Flow Shop Scheduling Problem with Fuzzy due Date

Abstract: Coping with the characteristic of flow shop scheduling problem with uncertain due date, fuzzy arithmetic on fuzzy numbers is applied to describe the problem, and then a new hybrid algorithm model which integrate particle swarm optimization into the evolutionary mechanism of the knowledge evolution algorithm is presented to solve the problem. By the evolutionary mechanism of knowledge evolution algorithm, we can exploit the global search ability. By the operating characteristic of PSO, we can enhance the local … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2018
2018

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…Table 1 summarizes some of the early efforts to solve the scheduling problems with a form of due date constraints using a non-exact method. More recently, Tang et al (2011) developed a metaheuristic to deal with fuzzy due dates in a flow shop environment. Panwalkar and Koulamas (2012) considered a twomachine flow shop problem with the objective of minimizing the total tardy jobs and finding a common due date for the jobs, and developed a heuristic algorithm with computational complexity of 2 () On for a special case of the problem.…”
Section: Related Workmentioning
confidence: 99%
“…Table 1 summarizes some of the early efforts to solve the scheduling problems with a form of due date constraints using a non-exact method. More recently, Tang et al (2011) developed a metaheuristic to deal with fuzzy due dates in a flow shop environment. Panwalkar and Koulamas (2012) considered a twomachine flow shop problem with the objective of minimizing the total tardy jobs and finding a common due date for the jobs, and developed a heuristic algorithm with computational complexity of 2 () On for a special case of the problem.…”
Section: Related Workmentioning
confidence: 99%