Rakrouki, M. A., Kooli, A., Chalghoumi, S., & Ladhari, T. (2020). A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates. Operational research, 20(1), 21-35. https://doi.org/10.1007/s12351-017-0308-7
Citace podle Chicago (17th ed.)Rakrouki, Mohamed Ali, Anis Kooli, Sabrine Chalghoumi, a Talel Ladhari. "A Branch-and-bound Algorithm for the Two-machine Total Completion Time Flowshop Problem Subject to Release Dates." Operational Research 20, no. 1 (2020): 21-35. https://doi.org/10.1007/s12351-017-0308-7.
Citace podle MLA (9th ed.)Rakrouki, Mohamed Ali, et al. "A Branch-and-bound Algorithm for the Two-machine Total Completion Time Flowshop Problem Subject to Release Dates." Operational Research, vol. 20, no. 1, 2020, pp. 21-35, https://doi.org/10.1007/s12351-017-0308-7.