Job-shop scheduling - using component packing and simulated annealing approach

An algorithm to solve the job-shop scheduling problem based on the componen t-packing principle is presented. This approach uses the principles of find ing an efficient packing of components by modelling machines as bins and op erations as components. The algorithm is based on adaptive simulated anneal ing. The proposed neighbourhood generation scheme is problem independent an d it provides fast and good solutions. Computational results show that this algorithm performs better than other recent annealing-based approaches.