Solving Fuzzy Job-Shop Scheduling Problem by a Hybrid PSO Algorithm
| dc.contributor.author | Junqing Li | |
| dc.contributor.author | Quan-Ke Pan | |
| dc.contributor.author | P. N. Suganthan | |
| dc.contributor.author | M. Fatih Tasgetiren | |
| dc.contributor.editor | L Rutkowski | |
| dc.contributor.editor | M Korytkowski | |
| dc.contributor.editor | R Scherer | |
| dc.contributor.editor | R Tadeusiewicz | |
| dc.contributor.editor | LA Zadeh | |
| dc.contributor.editor | JM Zurada | |
| dc.coverage.spatial | International Symposium on Swarm and Evolutionary Computation/ Symposium on Swarm Intelligence and Differential Evolution | |
| dc.date.accessioned | 2025-10-06T16:22:48Z | |
| dc.date.issued | 2012 | |
| dc.description.abstract | This paper proposes a hybrid particle swarm optimization (PSO) algorithm for solving the job-shop scheduling problem with fuzzy processing times. The objective is to minimize the maximum fuzzy completion time i.e. the fuzzy makespan. In the proposed PSO-based algorithm performs global explorative search while the tabu search (TS) conducts the local exploitative search. One-point crossover operator is developed for the individual to learn information from the other individuals. Experimental results on three well-known benchmarks and a randomly generated case verify the effectiveness and efficiency of the proposed algorithm. | |
| dc.identifier.isbn | 978-3-642-29352-8, 978-3-642-29353-5 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.uri | https://gcris.yasar.edu.tr/handle/123456789/7534 | |
| dc.language.iso | English | |
| dc.publisher | SPRINGER-VERLAG BERLIN | |
| dc.relation.ispartof | International Symposium on Swarm and Evolutionary Computation/ Symposium on Swarm Intelligence and Differential Evolution | |
| dc.source | SWARM AND EVOLUTIONARY COMPUTATION | |
| dc.subject | Fuzzy processing time, Job-shop scheduling problem, Particle swarm optimization, Tabu search | |
| dc.subject | PARTICLE SWARM OPTIMIZATION, GENETIC ALGORITHM, PROCESSING TIME, TABU SEARCH | |
| dc.title | Solving Fuzzy Job-Shop Scheduling Problem by a Hybrid PSO Algorithm | |
| dc.type | Conference Object | |
| dspace.entity.type | Publication | |
| gdc.coar.type | text::conference output | |
| gdc.index.type | WoS | |
| oaire.citation.endPage | 282 | |
| oaire.citation.startPage | 275 | |
| person.identifier.orcid | Suganthan- Ponnuthurai Nagaratnam/0000-0003-0901-5105, Pan- QUAN-KE/0000-0002-5022-7946, Tasgetiren- M. Fatih/0000-0001-8625-3671, Tasgetiren- Mehmet Fatih/0000-0002-5716-575X | |
| project.funder.name | National Science Foundation of China [61104179- 61174187], Science Research and Development of Provincial Dept of Public Education of Shandong [J09LG29- J11LG02- J10LG25] | |
| publicationvolume.volumeNumber | 7269 | |
| relation.isOrgUnitOfPublication | ac5ddece-c76d-476d-ab30-e4d3029dee37 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | ac5ddece-c76d-476d-ab30-e4d3029dee37 |