Results
eNauka >
Results >
A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor
| Title: | A Pareto optimal scheduling algorithm for two agents with compatible non-disjoint jobs on an unlimited serial-batch processor | Authors: | Li, Shuguang; Wei, Jing; Liang, Yanyue; Shen, Haoxuan; Simic, Vladimir D   ; Pamucar, Dragan S |
Issue Date: | 2024 | Publication: | CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH | ISSN: | 1435-246X Central European Journal of Operations Research Search Idenfier |
Type: | Article | DOI: | 10.1007/s10100-024-00954-9 | WoS-ID: | 001370716400001 | Scopus-ID: | 2-s2.0-85211766939 | URI: | https://enauka.gov.rs/handle/123456789/954200 | Project: | Natural Science Foundation of Shandong Province [ZR2020MA030] Natural Science Foundation of Shandong Province China |
Metadata source: | (Preuzeto iz Nasi u WoS) | M-category: | 22M22 |
Items in eNauka are protected by copyright, with all rights reserved, unless otherwise indicated.