Abstract This paper dealt with composite scheduling problems which combine manufacturing scheduling problems and/or transportation routing problems. Two scheduling models were formulated as the elements of the composite scheduling model, and the composite model was formulated composing these models with indispensable additional constraints. A hybrid genetic algorithm was developed to solve the composite scheduling problems. An improved representation based on random keys was developed to search permutation space. A genetic algorithm based dynamic programming approach was applied to select resource. The proposed technique and a previous technique are compared by three types of problems. All results indicate that the proposed technique is superior to the previous one.
