Propose a Polynomial Time Algorithm for Total Completion Time Objective

In this study, we integrate deteriorate jobs with repair&maintenance activity on a single machine scheduling subject to total completion time. This work has more than one motivation. First, jobs are assigned to machines in an automated production line. Later, to schedule the maintenance activiti...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of mathematical, engineering and management sciences Jg. 6; H. 3; S. 932 - 943
Hauptverfasser: Ozturkoglu, Yucel, Ozturkoglu, Omer
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Dehradun International Journal of Mathematical, Engineering and Management Sciences 01.06.2021
Ram Arti Publishers
Schlagworte:
ISSN:2455-7749, 2455-7749
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this study, we integrate deteriorate jobs with repair&maintenance activity on a single machine scheduling subject to total completion time. This work has more than one motivation. First, jobs are assigned to machines in an automated production line. Later, to schedule the maintenance activities, if needed, to prevent machinery from breaking down later. There are some important mathematical models to solve this combination. However, due to the complexity of the problem which is Np-hard, a polynomial algorithm should be needed for solving large problems. Therefore, this article introduces several polnomial algorithms to determine the order of things best. With using these algorithms, it will be possible to determine where to assign to the schedule, taking into account the number of maintenance activities required and their optimum total completion time.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2455-7749
2455-7749
DOI:10.33889/IJMEMS.2021.6.3.055