摘要

This paper deals with the problem that reflects real-world situations adequately. Several constraints including unrelated machines, limited waiting times between every two successive processing operations and ready time of jobs are studied. These constraints and characteristics affect on some operations in a large number of companies. In recent researches, they have been tackled many times while so far have not been considered simultaneously. The aim of this paper is to model and solve the addressed problem by applying an efficient metaheuristic algorithm, entitled biogeography-based optimization (BBO). To assess the proposed BBO, two experiments are conducted and their results in terms of solutions quality, as well as computation efficiency compared against two popular algorithms, namely imperialist competitive algorithm and population-based simulated annealing. Due to the sensitivity of the values of parameters in the metaheuristic algorithms, a response surface methodology as a strength statistical tool is used to tune the parameters. The computational results show that the proposed BBO algorithm significantly outperforms the other foregoing algorithms.

  • 出版日期2013-9