View in EDS HTML Full Text PDF Full Text

A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor.

Saved in:
Bibliographic Details
Title: A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor.
Authors: Li, Shuguang1 (AUTHOR) sgliytu@hotmail.com, Wei, Jing1 (AUTHOR) 2023420185@sdtbu.edu.cn, Liang, Yanyue1 (AUTHOR) 2021410063@sdtbu.edu.cn, Shen, Haoxuan1 (AUTHOR) 2021410051@sdtbu.edu.cn, Simic, Vladimir2,3,4 (AUTHOR) vsima@sf.bg.ac.rs, Pamucar, Dragan5,6 (AUTHOR) dragan.pamucar@fon.bg.ac.rs
Source: Central European Journal of Operations Research. Mar2026, Vol. 34 Issue 1, p161-181. 21p.
Database: Business Source Ultimate
Full text is not displayed to guests.
Description
ISSN:1435246X
DOI:10.1007/s10100-024-00954-9