A generalized permutation approach to job shop schedulingMth genetic algorithms

Abstract. In order to sequence the tasks of a job shopproblem (JSP) on a number of machines related to thetechnological machine order of jobs, a new representationtechnique - mathematically known as "permutationwith repetition" is presented. The main advantage of thissingle chromosome representation is - in analogy to thepermutation scheme of the traveling salesman problem(TSP) - that it cannot produce illegal operation sequences.As a consequence of the representation schemea new crossover operator preserving the initial schemestructure of permutations with repetition will besketched. Its behavior is similar to the well known Order-Crossover for simple permutation schemes. Actually theGOX operator for permutations with...