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 overcome challenge [1]. In this paper we describe an approach modelling using a graph theoretic model. particular, focus on single machine and job shop problems. We show that model can extended open also discuss how used classify scheduling problems from generated models.