•We study scheduling problems where processing times can be reduced via resources. •We provide a constant approximation algorithm for the general problem. •We provide polynomial time approximation schemes for special cases. •We establish a relationship between the two main parameters of the problem.
European Journal of Operational Research – Elsevier
Published: Jul 1, 2018
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud