Upper and lower bounds on the makespan of schedules for tree dags on linear arrays
From MaRDI portal
Publication:1277394
DOI10.1007/PL00009254zbMATH Open0918.68044OpenAlexW1982462728MaRDI QIDQ1277394
Author name not available (Why is that?)
Publication date: 17 August 1999
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009254
No records found.
No records found.
This page was built for publication: Upper and lower bounds on the makespan of schedules for tree dags on linear arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1277394)