Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion

From MaRDI portal
Publication:6103746

DOI10.1007/s10951-022-00759-1zbMath1517.90054OpenAlexW4306698950MaRDI QIDQ6103746

Vincent T'kindt, Olivier Ploton

Publication date: 27 June 2023

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-022-00759-1






Cites Work


This page was built for publication: Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion