Citáce podľa APA (7th ed.)

Romanova, A. A., & Servakh, V. V. (2019). Complexity of Cyclic Job Shop Scheduling Problems for Identical Jobs with No-Wait Constraints. Journal of applied and industrial mathematics, 13(4), 706-716. https://doi.org/10.1134/S1990478919040136

Citácia podle Chicago (17th ed.)

Romanova, A. A., a V. V. Servakh. "Complexity of Cyclic Job Shop Scheduling Problems for Identical Jobs with No-Wait Constraints." Journal of Applied and Industrial Mathematics 13, no. 4 (2019): 706-716. https://doi.org/10.1134/S1990478919040136.

Citácia podľa MLA (8th ed.)

Romanova, A. A., a V. V. Servakh. "Complexity of Cyclic Job Shop Scheduling Problems for Identical Jobs with No-Wait Constraints." Journal of Applied and Industrial Mathematics, vol. 13, no. 4, 2019, pp. 706-716, https://doi.org/10.1134/S1990478919040136.

Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..