Crossmark

Computational complexity and exact techniques for scheduling problems with job prohibitions

Crossref DOI link: https://doi.org/10.1007/s10951-025-00840-5

Published Online: 2025-04-02

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

Authors

Zakharova, Yulia https://orcid.org/0000-0003-4791-7011
Funding

Funding for this research was provided by:

Russian Science Foundation (22-71-10015)
License Information

Text and Data Mining valid from 2025-04-02

Version of Record valid from 2025-04-02
More Information

Article History

Accepted: 13 February 2025

First Online: 2 April 2025