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 Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

We investigate a single machine group scheduling problem with positiondependent processing times and ready times. The actual processing time of a job is a function of positivegroup-dependent job-independent positional factors. The actual setup time of the group is a linearfunction of the total completion time of the former group. Each job has a release time. The decisionshould be taken regarding possible sequences of jobs in each group and group sequence to minimize themakespan. We show that jobs in each group are scheduled in nondecreasing order of its release time andthe groups are arranged in nondecreasing order of some certain conditions. We also present a polynomialtime solution procedure for the special case of the proposed problem.

Single Machine Group Scheduling with Position Dependent Processing Times and Ready Times