References
- Battarra, M., Fraboni, F., Thomasson, O., Erdogan, G., Laporte, G., & Formentini, M. (2020). Algorithms for the calzedonia workload allocation problem. Journal of the Operational Research Society. https://doi.org/https://doi.org/10.1080/01605682.2020.1755897.
- Borba, L., & Ritt, M. (2014). Exact and heuristic methods for the assembly line worker assignment and balancing problem. Computers & Operations Research, 45, 87–96. https://doi.org/https://doi.org/10.1016/j.cor.2013.12.002
- Dolgui, A., & Battaïa, O. (2013). A taxonomy of line balancing problems and their solution approaches. International Journal of Production Economics, 142(2), 259–277. https://doi.org/https://doi.org/10.1016/j.ijpe.2012.10.020
- Scholl, A., & Becker, C. (2006). State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. European Journal of Operational Research, 168(3), 666–693. https://doi.org/https://doi.org/10.1016/j.ejor.2004.07.022
- Vilà, M., & Pereira, J. (2014). A branch-and-bound algorithm for assembly line worker assignment and balancing problems. Computers & Operations Research, 44, 105–114. https://doi.org/https://doi.org/10.1016/j.cor.2013.10.016