LI, Shuguang, WEI, Jing, LIANG, Yanyue, SHEN, Haoxuan, SIMIC, Vladimir und PAMUCAR, Dragan, 2026. A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor. Central European Journal of Operations Research. 1 März 2026. Vol. 34, no. 1, p. 161-181. DOI 10.1007/s10100-024-00954-9.
Elsevier - Harvard (with titles)Li, S., Wei, J., Liang, Y., Shen, H., Simic, V., Pamucar, D., 2026. A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor. Central European Journal of Operations Research 34, 161-181. https://doi.org/10.1007/s10100-024-00954-9
American Psychological Association 7th editionLi, S., Wei, J., Liang, Y., Shen, H., Simic, V., & Pamucar, D. (2026). A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor. Central European Journal of Operations Research, 34(1), 161-181. https://doi.org/10.1007/s10100-024-00954-9
Springer - Basic (author-date)Li S, Wei J, Liang Y, Shen H, Simic V, Pamucar D (2026) A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor.. Central European Journal of Operations Research 34:161-181. https://doi.org/10.1007/s10100-024-00954-9
Juristische Zitierweise (Stüber) (Deutsch)Li, Shuguang/ Wei, Jing/ Liang, Yanyue/ Shen, Haoxuan/ Simic, Vladimir/ Pamucar, Dragan, A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor., Central European Journal of Operations Research 2026, 161-181.