The single machine scheduling problem with setup times under an extension of the general learning and forgetting effects

This paper addresses the optimization of a single machine scheduling problem with additional constraints which are sequence-independent setup times and time-dependent learning and forgetting effects. The considered objective function is to minimize the maximum completion time (makespan). We define a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Optimization letters Jg. 15; H. 4; S. 1327 - 1343
Hauptverfasser:	Muştu, Settar, Eren, Tamer
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2021
Schlagworte:	Computational Intelligence Mathematics Mathematics and Statistics Numerical and Computational Physics Operations Research/Decision Theory Optimization Original Paper Simulation Setup time Pseudo polynomial time algorithm Learning effect Forgetting effect Complexity
ISSN:	1862-4472, 1862-4480
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!