Sadi, F., & Soukhal, A. (2017). Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs. Discrete optimization, 23, 93-104. https://doi.org/10.1016/j.disopt.2017.01.001
Chicago Style (17th ed.) CitationSadi, F., and A. Soukhal. "Complexity Analyses for Multi-agent Scheduling Problems with a Global Agent and Equal Length Jobs." Discrete Optimization 23 (2017): 93-104. https://doi.org/10.1016/j.disopt.2017.01.001.
MLA (9th ed.) CitationSadi, F., and A. Soukhal. "Complexity Analyses for Multi-agent Scheduling Problems with a Global Agent and Equal Length Jobs." Discrete Optimization, vol. 23, 2017, pp. 93-104, https://doi.org/10.1016/j.disopt.2017.01.001.
Warning: These citations may not always be 100% accurate.