Relaxation of Job Shop Scheduling Problem Using a Bipartite Graph

This paper addresses the Job Shop Scheduling Problem (JSSP). Basic constraints are established and it is modeled by a disjunctive graph. The model was mapped to Unrelated Parallel Machines Problem through a bipartite graph. An analysis of constraints is made in both problems to perform a relaxation of the manufacturing problem. Conducting the relaxation of JSSP, it is that any operation can be assigned to any machine, in addition, the precedence constraint between two operations longer applies. The application of approximated bipartite graph model is shown as a new alternative model to represent the JSSP problem, it may be an option to work with this type of problems instead of the disjunctive graph model.