In our earlier paper, in order to solving large-scale scheduling problems in reasonable computation time, heuristic solutions have been utilized as reference solutions for the crossover operation and the mutation operation. In this paper we propose a new technique for determining the reference solutions from many heuristic solutions and also the chance of changing the reference. The computational result is shown for a flow-shop scheduling problem.
展开▼