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(1), 161-181. https://doi.org/10.1007/s10100-024-00954-9

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.

Li, S., J. Wei, Y. Liang, H. Shen, V. Simic, und D. Pamucar. „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, Bd. 34, Nr. 1, März 2026, S. 161-8, https://doi.org/10.1007/s10100-024-00954-9.

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.

Li, S., Wei, J., Liang, Y., Shen, H., Simic, V. und 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, Vol. 34 No. 1, S. 161-181.