The disjunctive graph machine representation of the job shop scheduling problem

The disjunctive graph is one of the most popular models used for describing instances of the job shop scheduling problem, which has been very intensively explored. In this paper, a new time and memory efficient representation of the disjunctive graph is proposed. It has the form of a graph matrix and combines advantages of a few classical graph representations, enabling easy operating on the problem data. Computational experiments have proved higher efficiency of the proposed approach over the classical ones.