EUVIMEDEUVIMED entdecken
Crossref

Improved algorithm for minimizing total late work on a proportionate flow shop and extensions to job rejection and generalized due dates

Baruch Mor, Xin-Na Geng

Computers & Operations Research · 2025-09 · 181 · 107046

DOI: 10.1016/j.cor.2025.107046 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computers & Operations Research, 2025-09. Verfasst von Baruch Mor und 1 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 41 Literaturangaben. Gefördert von: Israel Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Israel Science Foundation

Zitieren

APA

Mor, B., & Geng, X. (2025). Improved algorithm for minimizing total late work on a proportionate flow shop and extensions to job rejection and generalized due dates. Computers & Operations Research, 181, 107046. https://doi.org/10.1016/j.cor.2025.107046

Vancouver

Mor B, Geng X. Improved algorithm for minimizing total late work on a proportionate flow shop and extensions to job rejection and generalized due dates. Computers & Operations Research. 2025;181:107046. doi:10.1016/j.cor.2025.107046

BibTeX
@article{Mor2025,
  author = {Mor, Baruch and Geng, Xin-Na},
  title = {Improved algorithm for minimizing total late work on a proportionate flow shop and extensions to job rejection and generalized due dates},
  journal = {Computers & Operations Research},
  year = {2025},
  volume = {181},
  pages = {107046},
  doi = {10.1016/j.cor.2025.107046}
}
Kostenlos starten →