Резултати
eNauka >
Results >
Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine
| Title: | Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine | Authors: | Shen, Haoxuan; Simic, Vladimir D   ; Li, Shuguang; Pamucar, Dragan S |
Issue Date: | 2025 | Publication: | JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS | ISSN: | 0377-0427 Journal of Computational and Applied Mathematics Search Idenfier |
Type: | Article | Collation: | 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 | Project: | Natural Science Foundation of Shandong Province China [ZR2020MA030] | Metadata source: | (Preuzeto iz Nasi u WoS) | M-category: | 21aM21a |
Резултати на еНаука су заштићени ауторским правима и сва права су задржана, осим ако није другачије назначено.