On lower and upper bounds for single machine parallel batch scheduling

On lower and upper bounds for single machine parallel batch scheduling

In this paper, we consider a single machine parallel batch scheduling problem subject to chains of jobs. We present polynomial lower and upper bounds as well as their experimental comparison and relative errors. According to the results of the numerical experiment, the relative difference between up...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimization letters 2022-12, Vol.16 (9), p.2557-2567
Hauptverfasser: Gafarov, Evgeny R., Dolgui, Alexandre
Format: Artikel
Sprache:eng
Schlagworte:
Automatic Control Engineering
Computational Intelligence
Computer Science
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we consider a single machine parallel batch scheduling problem subject to chains of jobs. We present polynomial lower and upper bounds as well as their experimental comparison and relative errors. According to the results of the numerical experiment, the relative difference between upper and lower bounds does not exceed 1.5.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-022-01857-x