Citace podle APA (7th ed.)

Nip, K., & Wang, Z. (2023). A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints. Journal of scheduling, 26(6), 543-558. https://doi.org/10.1007/s10951-021-00677-8

Citace podle Chicago (17th ed.)

Nip, Kameng, a Zhenbo Wang. "A Complexity Analysis and Algorithms for Two-machine Shop Scheduling Problems Under Linear Constraints." Journal of Scheduling 26, no. 6 (2023): 543-558. https://doi.org/10.1007/s10951-021-00677-8.

Citace podle MLA (9th ed.)

Nip, Kameng, a Zhenbo Wang. "A Complexity Analysis and Algorithms for Two-machine Shop Scheduling Problems Under Linear Constraints." Journal of Scheduling, vol. 26, no. 6, 2023, pp. 543-558, https://doi.org/10.1007/s10951-021-00677-8.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..