Improvement of Performance measures In multi level assembly job shops Using particle swarm optimization And genetic algorithm

Abstract

Assembly job shop scheduling problems that optimize lead newlineTime and tardiness are usually much more computationally complex and newlineare classified as strongly Non deterministic Polynomial NP hard type newlineParticle Swarm Optimization PSO Algorithm and Genetic Algorithm newline GA are able to find near optimal solutions for a wide range of newlinecombinatorial optimization problems Earlier research studies in newline scheduling of operations in job shops processing multi level assembly newlinejobs have revealed that no single rule was able to perform well for all newline measures of performance Panwalkar and Iskander 1977 Haupt 1989 newline The dispatching rules that performed well in simple job shops are not necessarily appropriate for assembly job shops Ramasesh 1990 newline