Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times

DOI10.1051/ro/2023091zbMath1521.90062OpenAlexW4380610780MaRDI QIDQ6050626

Ali Allahverdi, 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/2023091

zbMATH Keywords

algorithmschedulingmakespanflowshopuncertain processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

This page was built for publication: Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times