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 application/pdf
.
Particle Swarm Optimization and Other Metaheuristic Methods in Hybrid Flow Shop Scheduling Problem
[chapter]
2009
Particle Swarm Optimization
Multiprocessor task scheduling is a generalized form of classical machine scheduling where a task is processed by more than one processor. It is a challenging problem encountered in wide range of applications and it is vastly studied in the scheduling literature (see for instance (Chan & Drozdowski, 1996) for a comprehensive introduction on this topic). However, Drozdowski (1996) shows that multiprocessor task scheduling is difficult to solve even in its simplest form. Hence, many heuristic
doi:10.5772/6746
fatcat:7fjpfhpqojgddgomj5mvnx7hai