Manufacturing production line modelling and classification of associated np-hard problems

Optimisation of production lines is known to be NP-Hard in the general case so many near-optimal approximation algorithms have been researched to overcome the challenge. In this paper we describe an approach to modelling production lines using a graph theoretic model. In particular, we focus on single machine and job shop problems. We show that the model can be extended to open shop problems. We also discuss how the model can be used to classify scheduling problems from the generated models.peer-reviewe