An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements
From MaRDI portal
Publication:6497031
DOI10.1007/S10878-024-01121-1MaRDI QIDQ6497031
Author name not available (Why is that?)
Publication date: 6 May 2024
Published in: (Search for Journal in Brave)
No records found.
This page was built for publication: An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6497031)