Minimizing total tardiness in a two-machine flowshop with uncertain and bounded processing times

DOI10.1051/RO/2023023zbMath1521.90076OpenAlexW4321377639MaRDI QIDQ6050598

Muberra Allahverdi

Publication date: 19 September 2023

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2023023

zbMATH Keywords

algorithmflowshop schedulingtotal tardinessuncertain processing times

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

This page was built for publication: Minimizing total tardiness in a two-machine flowshop with uncertain and bounded processing times