Self-adaptive memetic algorithms for multi-objective single machine learning-effect scheduling problems with release times

This paper proposes a single machine scheduling problem with learning-effect and release times by considering two objectives requiring minimization of makespan and total tardiness, simultaneously. Due to the NP-hardness of this problem, two memetic algorithms with meme variants are presented for sol...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Flexible services and manufacturing journal Jg. 34; H. 3; S. 748 - 784
1. Verfasser: Deliktaş, Derya
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.09.2022
Springer Nature B.V
Schlagworte:
Adaptive algorithms
Algorithms
Engineering
Machine learning
Machines
Manufacturing
Operations Management
Operations Research/Decision Theory
Processes
Scheduling
Memetic algorithms
Hyper-heuristics
Learning effect
Single machine scheduling
Scalarization methods
ISSN:1936-6582, 1936-6590
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper proposes a single machine scheduling problem with learning-effect and release times by considering two objectives requiring minimization of makespan and total tardiness, simultaneously. Due to the NP-hardness of this problem, two memetic algorithms with meme variants are presented for solving the bi-objective problem and applied by combining three different scalarization methods, including weighted sum, conic, and tchebycheff. The performance of all memetic algorithms with the meme is investigated across randomly generated twenty-seven test problems ranging from ‘small’ to ‘large’ size. The experimental results indicate that the Multimeme Memetic Algorithm using the tchebycheff outperforms the other algorithms producing the best-known results for almost all bi-objective single machine scheduling instances with learning-effects. All algorithms perform effectively in solving large-sized problems with up to 200 jobs.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1936-6582
1936-6590
DOI:10.1007/s10696-021-09434-7