USING PERMUTATION SPACES IN JOB-SHOP SCHEDULING

The space of permutations of {1, ..., mn} is mapped onto the space of feasible solutions of the general job-shop scheduling problem n/m/G/C(max) by two algorithms. The first algorithm produces a makespan which satisfies an analogue of continuity, for large m and n, on the space of permutations with the inverse metric. Simulations results are presented for two examples which show that the second algorithm produces good makespans compared to those produced by priority rules.