A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints

From MaRDI portal
Publication:6204660

DOI10.1007/S10951-021-00677-8OpenAlexW3139253831MaRDI QIDQ6204660FDOQ6204660


Authors: Kameng Nip, Zhenbo Wang Edit this on Wikidata


Publication date: 2 April 2024

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-021-00677-8







Cites Work






This page was built for publication: A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204660)