Online scheduling of two-machine flowshop with lookahead and incompatible job families
Crossref DOI link: https://doi.org/10.1007/s10878-022-00974-8
Published Online: 2023-01-09
Published Print: 2023-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Qian, Xia
Xingong, Zhang http://orcid.org/0000-0002-7724-5511
Funding for this research was provided by:
the Natural Science Foundation of China (11991022, 11971443)
Text and Data Mining valid from 2023-01-01
Version of Record valid from 2023-01-01
Article History
Accepted: 19 December 2022
First Online: 9 January 2023