Abstract:

A kind of hybrid heuristic genetic algorithm is introduced for the job shop problem n/m/G/C max, in which the scheduling rules of SPT and MWKR are applied, and the neighbourhood search technique (NST) is adopted as an auxiliary procedure to improve the solution performance. The new algorithm is proved to be both effective and efficient by the comparison with some methods in common use at present.

Key words: sequencing, production planning, heur istic appr oa ch, genetic algor ithm