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/

Global: Zendy Plus annual

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

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper, we analyze approximation algorithms for two types of scheduling problems. The first is the n jobs scheduling problem with due dates on m identical machines to minimize the maximum lateness. For this problem n/m/I/Lmax, we propose two approximation algorithms and derive their worst case bounds. The second is the 2 x n flow shop scheduling problem with due dates to minimize the maximum lateness. For this problem n/2/F/Lmax' we first give a solvable case in the sense that the optimal schedule can be easily found. Then we again propose an approximation algorithm for general n/2/F/Lmax and derive its worst case bound.

SOME BOUNDS ON APPROXIMATION ALGORITHMS FOR n/m/I/L_<MAX> AND n/2/F/L_<MAX> SCHEDULING PROBLEMS