A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
The permutation flow shop scheduling problem (PFSP) is a renowned problem in the scheduling research community. It is an NP-hard combinatorial optimization problem that has useful real-world applications. In this problem, finding a useful algorithm to handle the massive amounts of jobs required to retrieve an actionable permutation order in a reasonable amount of time is important. The recently developed crow search algorithm (CSA) is a novel swarm-based metaheuristic algorithm originallydoi:10.3390/app9071353 fatcat:jkpvvditujg57ly3f7m32uipsq