Solving Fuzzy Job-Shop Scheduling Problem by a Hybrid PSO Algorithm
MetadataShow full item record
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
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..