Results
eNauka >
Rezultati >
Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine
| Naziv: | Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine | Autori: | Shen, Haoxuan; Simic, Vladimir D   ; Li, Shuguang; Pamucar, Dragan S |
Godina: | 2025 | Publikacija: | JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS | ISSN: | 0377-0427 Journal of Computational and Applied Mathematics Pretraži identifikator |
Tip rezultata: | Naučni članak | Kolacija: | vol. 459 str. 116380-116380 | DOI: | 10.1016/j.cam.2024.116380 | WoS-ID: | 001386240100001 | Scopus-ID: | 2-s2.0-85209579188 | URI: | https://enauka.gov.rs/handle/123456789/961432 | Projekat: | Natural Science Foundation of Shandong Province China [ZR2020MA030] | Izvor metapodataka: | (Preuzeto iz Nasi u WoS) | M-kategorija: | 21aM21a - Vodeći međunarodni časopis kategorije M21a |
Items in eNauka are protected by copyright, with all rights reserved, unless otherwise indicated.