Document is current

Any future updates will be listed below

On complexity of optimal recombination for flowshop scheduling problems

Crossref DOI link: https://doi.org/10.1134/S1990478916020071

Published Online: 2016-05-22

Published Print: 2016-04

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark