Publisher
Springer Nature Switzerland
Reference13 articles.
1. Aldous, D., Vazirani, U.: “Go with the winners” algorithms. In: Proceedings of 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA, pp. 492–501. IEEE (1994). https://doi.org/10.1109/SFCS.1994.365742
2. Battaïa, O., Dolgui, A.: A taxonomy of line balancing problems and their solution approaches. Int. J. Prod. Econ. 142, 259–277 (2013)
3. Battaïa, O., Dolgui, A.: Hybridizations in line balancing problems: a comprehensive review on new trends and formulations. Int. J. Prod. Econ. 250(5), 108673 (2022)
4. Borisovsky, P.: A parallel “Go with the winners” algorithm for some scheduling problems. J. Appl. Ind. Math. (in press)
5. Lecture Notes in Computer Science;P Borisovsky,2021