%0 Journal Article %1 journals/orl/NowickiS91 %A Nowicki, Eugeniusz %A Smutnicki, Czeslaw %D 1991 %J Oper. Res. Lett. %K dblp %N 8 %P 473-480 %T Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling. %U http://dblp.uni-trier.de/db/journals/orl/orl10.html#NowickiS91 %V 10

@article{journals/orl/NowickiS91, added-at = {2019-05-31T00:00:00.000+0200}, author = {Nowicki, Eugeniusz and Smutnicki, Czeslaw}, biburl = {https://www.bibsonomy.org/bibtex/26234333c2e810d52fd1548d41a57b882/dblp}, ee = {https://doi.org/10.1016/0167-6377(91)90025-K}, interhash = {4c7f85f7f44cb6c24b37dc44b9f876df}, intrahash = {6234333c2e810d52fd1548d41a57b882}, journal = {Oper. Res. Lett.}, keywords = {dblp}, number = 8, pages = {473-480}, timestamp = {2019-06-01T11:47:41.000+0200}, title = {Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling.}, url = {http://dblp.uni-trier.de/db/journals/orl/orl10.html#NowickiS91}, volume = 10, year = 1991 }