EUVIMEDEUVIMED entdecken
Crossref

On the inapproximability of two-machine open shop scheduling with exact delays

Shunzhang Lu, An Zhang, Mengyuan Hu, Yong Chen, Guangting Chen

Theoretical Computer Science · 2026-07 · 1080 · 116035

DOI: 10.1016/j.tcs.2026.116035 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-07. Verfasst von Shunzhang Lu und 4 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 30 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Zhejiang Province Natural Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Natural Science Foundation of China
  • Zhejiang Province Natural Science Foundation

Zitieren

APA

Lu, S., Zhang, A., Hu, M., Chen, Y., & Chen, G. (2026). On the inapproximability of two-machine open shop scheduling with exact delays. Theoretical Computer Science, 1080, 116035. https://doi.org/10.1016/j.tcs.2026.116035

Vancouver

Lu S, Zhang A, Hu M, Chen Y, Chen G. On the inapproximability of two-machine open shop scheduling with exact delays. Theoretical Computer Science. 2026;1080:116035. doi:10.1016/j.tcs.2026.116035

BibTeX
@article{Lu2026,
  author = {Lu, Shunzhang and Zhang, An and Hu, Mengyuan and Chen, Yong and Chen, Guangting},
  title = {On the inapproximability of two-machine open shop scheduling with exact delays},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1080},
  pages = {116035},
  doi = {10.1016/j.tcs.2026.116035}
}
Kostenlos starten →