A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
Crossref DOI link: https://doi.org/10.1007/s10951-016-0478-9
Published Online: 2016-04-08
Published Print: 2017-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
van Bevern, René
Niedermeier, Rolf
Suchý, Ondřej
Funding for this research was provided by:
Grantová Agentura České Republiky (14-13017P)
Russian Foundation for Basic Research (16-31-60007 mol_a_dk)
Text and Data Mining valid from 2016-04-08