EUVIMEDEUVIMED entdecken
Crossref

Approximation algorithm for the W-prize-collecting scheduling problem on a single machine with release dates and rejection

Tianjiao Guo, Wen Liu, Gengsheng Zhang, Bo Hou

Discrete Applied Mathematics · 2026-10 · 391 · 122-126

DOI: 10.1016/j.dam.2026.04.046 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-10. Verfasst von Tianjiao Guo und 3 weiteren Autor:innen. Die Arbeit nennt 16 Literaturangaben. Gefördert von: Hebei Provincial Natural Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Hebei Provincial Natural Science Foundation

Zitieren

APA

Guo, T., Liu, W., Zhang, G., & Hou, B. (2026). Approximation algorithm for the W-prize-collecting scheduling problem on a single machine with release dates and rejection. Discrete Applied Mathematics, 391, 122-126. https://doi.org/10.1016/j.dam.2026.04.046

Vancouver

Guo T, Liu W, Zhang G, Hou B. Approximation algorithm for the W-prize-collecting scheduling problem on a single machine with release dates and rejection. Discrete Applied Mathematics. 2026;391:122-126. doi:10.1016/j.dam.2026.04.046

BibTeX
@article{Guo2026,
  author = {Guo, Tianjiao and Liu, Wen and Zhang, Gengsheng and Hou, Bo},
  title = {Approximation algorithm for the W-prize-collecting scheduling problem on a single machine with release dates and rejection},
  journal = {Discrete Applied Mathematics},
  year = {2026},
  volume = {391},
  pages = {122--126},
  doi = {10.1016/j.dam.2026.04.046}
}
Kostenlos starten →