Solving fuzzy job-shop scheduling problem by a hybrid PSO algorithm
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
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84860667482&doi=10.1007%2f978-3-642-29353-5_32&partnerID=40&md5=8a6092da2dacc253c048f58bc42b87echttps://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10570
Collections

DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..