Scatter Search Based Particle Swarm Optimization Algorithm for Earliness/Tardiness Flowshop Scheduling with Uncertainty
Considering the imprecise nature of the data in real-world problems, the earliness/tardiness (E/T) fiowshop scheduling problem with uncertain processing time and distinct due windows is concerned in this paper. A fuzzy scheduling model is established and then transformed into a deterministic one by...
Saved in:
| Published in | International journal of automation and computing Vol. 13; no. 3; pp. 285 - 295 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Beijing
Institute of Automation, Chinese Academy of Sciences
01.06.2016
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1476-8186 2153-182X 1751-8520 2153-1838 |
| DOI | 10.1007/s11633-016-0964-8 |
Cover
| Summary: | Considering the imprecise nature of the data in real-world problems, the earliness/tardiness (E/T) fiowshop scheduling problem with uncertain processing time and distinct due windows is concerned in this paper. A fuzzy scheduling model is established and then transformed into a deterministic one by employing the method of maximizing the membership function of middle value. Moreover, an effective scatter search based particle swarm optimization (SSPSO) algorithm is proposed to minimize the sum of total earliness and tardiness penalties. The proposed SSPSO algorithm incorporates the scatter search (SS) algorithm into the frame of particle swarm optimization (PSO) algorithm and gives full play to their characteristics of fast convergence and high diversity. Besides, a differential evolution (DE) scheme is used to generate solutions in the SS. In addition, the dynamic update strategy and critical conditions are adopted to improve the performance of SSPSO. The simulation results indicate the superiority of SSPSO in terms of effectiveness and efficiency. |
|---|---|
| Bibliography: | Earliness/tardiness (E/T), scheduling, fuzzy modeling, scatter search (SS), particle swarm optimization (PSO). Considering the imprecise nature of the data in real-world problems, the earliness/tardiness (E/T) fiowshop scheduling problem with uncertain processing time and distinct due windows is concerned in this paper. A fuzzy scheduling model is established and then transformed into a deterministic one by employing the method of maximizing the membership function of middle value. Moreover, an effective scatter search based particle swarm optimization (SSPSO) algorithm is proposed to minimize the sum of total earliness and tardiness penalties. The proposed SSPSO algorithm incorporates the scatter search (SS) algorithm into the frame of particle swarm optimization (PSO) algorithm and gives full play to their characteristics of fast convergence and high diversity. Besides, a differential evolution (DE) scheme is used to generate solutions in the SS. In addition, the dynamic update strategy and critical conditions are adopted to improve the performance of SSPSO. The simulation results indicate the superiority of SSPSO in terms of effectiveness and efficiency. 11-5350/TP ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1476-8186 2153-182X 1751-8520 2153-1838 |
| DOI: | 10.1007/s11633-016-0964-8 |