Approximation algorithms for the twin robot scheduling problem
Crossref DOI link: https://doi.org/10.1007/s10951-019-00631-9
Published Online: 2020-01-07
Published Print: 2020-02
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Jaehn, Florian http://orcid.org/0000-0003-1778-1723
Wiehl, Andreas
Funding for this research was provided by:
Deutsche Forschungsgemeinschaft (JA 2311/2-1)
Text and Data Mining valid from 2020-01-07
Version of Record valid from 2020-01-07
Article History
First Online: 7 January 2020