Dual-resource flexible job shop scheduling problem considering no-tardiness constraints
Computers & Operations Research · 2026-12 · 196 · 107682
DOI: 10.1016/j.cor.2026.107682 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2026-12. Verfasst von Shuangyuan Shi und 2 weiteren Autor:innen. Die Arbeit nennt 46 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Xiaogan Municipality, Natural Science Foundation of Hubei Province.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
- Natural Science Foundation of Xiaogan Municipality
- Natural Science Foundation of Hubei Province
Zitieren
APA
Shi, S., Xiong, H., & Liu, C. (2026). Dual-resource flexible job shop scheduling problem considering no-tardiness constraints. Computers & Operations Research, 196, 107682. https://doi.org/10.1016/j.cor.2026.107682
Vancouver
Shi S, Xiong H, Liu C. Dual-resource flexible job shop scheduling problem considering no-tardiness constraints. Computers & Operations Research. 2026;196:107682. doi:10.1016/j.cor.2026.107682
BibTeX
@article{Shi2026,
author = {Shi, Shuangyuan and Xiong, Hegen and Liu, Chang},
title = {Dual-resource flexible job shop scheduling problem considering no-tardiness constraints},
journal = {Computers & Operations Research},
year = {2026},
volume = {196},
pages = {107682},
doi = {10.1016/j.cor.2026.107682}
}
EUVIMED