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
approximation algorithmNP-hardheuristic algorithmsworst case analysisDannenbring's algorithmpermutation flow-shop schedulingrapid access algorithm
Related Items (8)
A note on worst-case analysis of approximation algorithms for a scheduling problem ⋮ Experimental comparison of heuristics for flow shop scheduling ⋮ New results in the worst-case analysis for flow-shop scheduling ⋮ A linear time approximation algorithm for permutation flow shop scheduling ⋮ A new constructive heuristic for the flowshop scheduling problem ⋮ Some results of the worst-case analysis for flow shop scheduling ⋮ Non-bottleneck machines in three-machine flow shops ⋮ Performance guarantees for flowshop heuristics to minimize makespan
Cites Work
This page was built for publication: Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling