On lower and upper bounds for single machine parallel batch scheduling - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Optimization Letters Année : 2022

On lower and upper bounds for single machine parallel batch scheduling

Résumé

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.
Fichier non déposé

Dates et versions

hal-03981853 , version 1 (10-02-2023)

Identifiants

Citer

Evgeny Gafarov, Alexandre Dolgui. On lower and upper bounds for single machine parallel batch scheduling. Optimization Letters, 2022, 16 (9), pp.2557-2567. ⟨10.1007/s11590-022-01857-x⟩. ⟨hal-03981853⟩
16 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More