EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

Dynamic idle-time bounding mechanism for job shop scheduling problems

Christian Perez, Rubén Mas, Miguel A. Salido

Computers & Operations Research · 2026-12 · 196 · 107660

DOI: 10.1016/j.cor.2026.107660 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computers & Operations Research, 2026-12. Verfasst von Christian Perez und 2 weiteren Autor:innen. Die Arbeit nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: Ministerio de Ciencia e Innovación, Spain Ministry of Science Innovation and Universities.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Ministerio de Ciencia e Innovación
  • Spain Ministry of Science Innovation and Universities

Zitieren

APA

Perez, C., Mas, R., & Salido, M. A. (2026). Dynamic idle-time bounding mechanism for job shop scheduling problems. Computers & Operations Research, 196, 107660. https://doi.org/10.1016/j.cor.2026.107660

Vancouver

Perez C, Mas R, Salido MA. Dynamic idle-time bounding mechanism for job shop scheduling problems. Computers & Operations Research. 2026;196:107660. doi:10.1016/j.cor.2026.107660

BibTeX
@article{Perez2026,
  author = {Perez, Christian and Mas, Rubén and Salido, Miguel A.},
  title = {Dynamic idle-time bounding mechanism for job shop scheduling problems},
  journal = {Computers & Operations Research},
  year = {2026},
  volume = {196},
  pages = {107660},
  doi = {10.1016/j.cor.2026.107660}
}
Kostenlos starten →