On Flowshop Scheduling with the DeJong’s Learning Effect
Asia-Pacific Journal of Operational Research · 23.07.2026
DOI: 10.1142/s0217595926500296 ↗Kurz gefasst
Fachartikel in der Zeitschrift Asia-Pacific Journal of Operational Research, online erschienen am 23.07.2026. Verfasst von Kai-Fang Zhang und 2 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref).
Abstract (Originalsprache)
This study deals with an [Formula: see text]-machine flowshop problem with the DeJong’s learning effect, in which [Formula: see text] is the number of machines. The goal is to identify a permutation that minimizes the maximum completion time, i.e., the makespan. We derive several properties, lower bounds, and initial upper bounds, and then propose a branch-and-bound algorithm. Additionally, we develop several heuristic algorithms. Computational tests are presented to evaluate the effectiveness and performance of these algorithms.
Zitieren
APA
Zhang, K., Wang, J., & Lu, Y. (2026). On Flowshop Scheduling with the DeJong’s Learning Effect. Asia-Pacific Journal of Operational Research. https://doi.org/10.1142/s0217595926500296
Vancouver
Zhang K, Wang J, Lu Y. On Flowshop Scheduling with the DeJong’s Learning Effect. Asia-Pacific Journal of Operational Research. 2026. doi:10.1142/s0217595926500296
BibTeX
@article{Zhang2026,
author = {Zhang, Kai-Fang and Wang, Ji-Bo and Lu, Yuan-Yuan},
title = {On Flowshop Scheduling with the DeJong’s Learning Effect},
journal = {Asia-Pacific Journal of Operational Research},
year = {2026},
doi = {10.1142/s0217595926500296}
}
EUVIMED