APA (7th ed.) Citation

KOUIDER, A., & AIT HADDADÈNE, H. (2021). A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: A mixed graph coloring approach. Computers & operations research, 132, 105319. https://doi.org/10.1016/j.cor.2021.105319

Chicago Style (17th ed.) Citation

KOUIDER, Ahmed, and Hacène AIT HADDADÈNE. "A Bi-objective Branch-and-bound Algorithm for the Unit-time Job Shop Scheduling: A Mixed Graph Coloring Approach." Computers & Operations Research 132 (2021): 105319. https://doi.org/10.1016/j.cor.2021.105319.

MLA (9th ed.) Citation

KOUIDER, Ahmed, and Hacène AIT HADDADÈNE. "A Bi-objective Branch-and-bound Algorithm for the Unit-time Job Shop Scheduling: A Mixed Graph Coloring Approach." Computers & Operations Research, vol. 132, 2021, p. 105319, https://doi.org/10.1016/j.cor.2021.105319.