Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut

From MaRDI portal
Publication:2835686

DOI10.1007/978-3-319-45587-7_27zbMath1451.90060OpenAlexW2516019428MaRDI QIDQ2835686

No author found.

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_27




Related Items (1)



Cites Work


This page was built for publication: Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut