Solution representation for job shop scheduling problems in ant colony optimisation

Production scheduling problems such as the job shop consist of a collection of operations (grouped into jobs) that must be scheduled for processing on different machines. Typical ant colony optimisation applications for these problems generate solutions by constructing a permutation of the operations, from which a deterministic algorithm can generate the actual schedule. This paper considers an alternative approach in which each machine is assigned a dispatching rule, which heuristically determines the order of operations on that machine. This representation creates a substantially smaller search space that likely contains good solutions. The performance of both approaches is compared on a real-world job shop scheduling problem in which processing times and job due dates are modelled with fuzzy sets. Results indicate that the new approach produces better solutions more quickly than the traditional approach.