EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

The distributed permutation flowshop scheduling problem with tool transfers to minimize the total tardiness

Martin Schönheit, Tristan Becker, Rainer Lasch

Computers & Operations Research · 2026-08 · 107625

DOI: 10.1016/j.cor.2026.107625 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computers & Operations Research, 2026-08. Verfasst von Martin Schönheit und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 94 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Schönheit, M., Becker, T., & Lasch, R. (2026). The distributed permutation flowshop scheduling problem with tool transfers to minimize the total tardiness. Computers & Operations Research, 107625. https://doi.org/10.1016/j.cor.2026.107625

Vancouver

Schönheit M, Becker T, Lasch R. The distributed permutation flowshop scheduling problem with tool transfers to minimize the total tardiness. Computers & Operations Research. 2026:107625. doi:10.1016/j.cor.2026.107625

BibTeX
@article{Schnheit2026,
  author = {Schönheit, Martin and Becker, Tristan and Lasch, Rainer},
  title = {The distributed permutation flowshop scheduling problem with tool transfers to minimize the total tardiness},
  journal = {Computers & Operations Research},
  year = {2026},
  pages = {107625},
  doi = {10.1016/j.cor.2026.107625}
}
Kostenlos starten →