Joint replenishment problem meets scheduling: algorithms for the maximum flow time objective
Kis, Tamás and Tamási, Tímea (2025) Joint replenishment problem meets scheduling: algorithms for the maximum flow time objective. OPTIMIZATION: A JOURNAL OF MATHEMATICAL PROGRAMMING AND OPERATIONS RESEARCH. ISSN 0233-1934 10.1080/02331934.2025.2505465
|
Text
Kis_1_36194311_z.pdf Restricted to Registered users only Request a copy |
Official URL: https://doi.org/10.1080/02331934.2025.2505465
| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Divisions: | Research Laboratory on Engineering & Management Intelligence |
| SWORD Depositor: | MTMT Injector |
| Depositing User: | MTMT Injector |
| Date Deposited: | 27 Jan 2026 07:56 |
| Last Modified: | 27 Jan 2026 07:56 |
| URI: | https://eprints.sztaki.hu/id/eprint/11096 |
 |
Update Item |
