A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job
Crossref DOI link: https://doi.org/10.1007/s10951-015-0454-9
Published Online: 2015-09-28
Published Print: 2016-02
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Dugarzhapov, Aldar
Kononov, Alexander
Funding for this research was provided by:
Russian Foundation for Humanity (RFH-NSC 13-22-10002)
Text and Data Mining valid from 2015-09-28