No abstract

No abstract

No abstract

Machine loading problem in flexible manufacturing system is considered as a vital prerelease decision. Loading problem is concerned with assignment of necessary operations of the selected jobs to various machines in an optimal manner to minimize system unbalance under technological constraints of limited tool slots and operation time. Such a problem is combinatorial in nature and found to be NP-hard; thus, finding the exact solutions is computationally intractable and becomes impractical as the problem size increases. To alleviate above limitations, a meta-heuristic approach based on particle swarm optimization (PSO) has been proposed in this paper to solve the machine loading problem. Mutation, a commonly used operator in genetic algorithm, has been introduced in PSO so that trapping of solutions at local minima or premature convergence can be avoided. Logistic mapping is used to generate chaotic numbers in this paper. Use of chaotic numbers makes the algorithm converge fast toward global optimum and hence reduce computational effort further. Twenty benchmark problems available in open literature have been solved using the proposed heuristic. Comparison between the results obtained by the proposed heuristic and the existing methods show that the results obtained are encouraging at significantly less computational effort.

No abstract