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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

This paper deals with the problem of sequencing n jobs on a single machine. Associated with each job is its processing time and its deferral rate. In addition, a general precedence relation exists among jobs. The problem is to find the job sequence which is consistent with the preceden;e relation so as to minimize the sum of the deferral cost. This problem has been considered by Sidney and he has presented a decomposition algorithm. In this paper, it is shown that Sidney's algorithm is not effective for some cases. A new algorithm is presented and it is proved that the algorithm produces an optimal sequence. An illustrative example is shown in the final section.

SINGLE-MACHINE SEQUENCING WITH PRECEDENCE CONSTRAINTS AND DEFERRAL COSTS