Minimizing total completion time for flowshop scheduling problem with uncertain processing times

DOI10.1051/RO/2020022zbMath1469.90074OpenAlexW3007570622MaRDI QIDQ5002266

Muberra Allahverdi, Ali Allahverdi

Publication date: 27 July 2021

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

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

zbMATH Keywords

schedulingtotal completion timeuncertain processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

This page was built for publication: Minimizing total completion time for flowshop scheduling problem with uncertain processing times