An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan
From MaRDI portal
Publication:6041237
DOI10.1051/RO/2023003zbMATH Open1519.90072MaRDI QIDQ6041237
Author name not available (Why is that?)
Publication date: 26 May 2023
Published in: (Search for Journal in Brave)
No records found.
No records found.
This page was built for publication: An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041237)
