Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling

From MaRDI portal
Publication:1183390

DOI10.1016/0167-6377(91)90025-KzbMath0772.90054OpenAlexW1979770131MaRDI QIDQ1183390

Czesław Smutnicki, Eugeniusz Nowicki

Publication date: 28 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90025-k




Related Items (8)




Cites Work




This page was built for publication: Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling