Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/117042| Title: | Manufacturing production line modelling and classification of associated np-hard problems |
| Authors: | Bonello, Joseph Abela, John Cachia, Ernest |
| Keywords: | Assembly-line methods Scheduling Graph theory Computational complexity NP-complete problems |
| Issue Date: | 2018 |
| Publisher: | Graphy Publications |
| Citation: | Bonello, J., Abela, J., & Cachia, E. (2018). Manufacturing production line modelling and classification of associated np-hard problems. International Journal of Computer & Software Engineering, 2(128), 10.15344/2456-4451/2018/128. |
| Abstract: | 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. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/117042 |
| Appears in Collections: | Scholarly Works - FacICTCIS |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Manufacturing_production_line_modelling_and_classification_of_associated_np_hard_problems_2018.pdf | 723.8 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.