English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We study the early work scheduling problem on identical parallel machines inorder to maximize the total early work, i.e., the parts of non-preemptive jobsexecuted before a common due date. By preprocessing and constructing anauxiliary instance which has several good properties, we propose an efficientpolynomial time approximation scheme with running time $O(n)$, which improvesthe result in [Gy\"{o}rgyi, P., Kis, T. (2020). A common approximationframework for early work, late work, and resource leveling problems. {\itEuropean Journal of Operational Research}, 286(1), 129-137], and a fullypolynomial time approximation scheme with running time $O(n)$ when the numberof machines is a fixed number, which improves the result in [Chen, X., Liang,Y., Sterna, M., Wang, W., B{\l}a\.{z}ewicz, J. (2020b). Fully polynomial timeapproximation scheme to maximize early work on parallel machines with commondue date. {\it European Journal of Operational Research}, 284(1), 67-74], where$n$ is the number of jobs, and the hidden constant depends on the desiredaccuracy.

Improved approximation schemes for early work scheduling on identical parallel machines with common due date