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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The present paper considers a more practical problem of scheduling n jobs in a two machine specially structured open shop to minimize the rental cost. Further the processing time of jobs are associated with their respective probabilities including job block criteria. In most of literature the processing times are always considered to be random, but there are significant situations in which processing times are not merely random but bear a well defined structural relationship to one another. The objective of this paper is to minimize the rental cost of machines under a specified rental policy. A numerical illustration is given to support the algorithm.

A HEURISTIC FOR TWO MACHINE OPEN SHOP SPECIALLY STRUCTURED SCHEDULING PROBLEM TO MINIMIZE THE RENTAL COST, INCLUDING JOB BLOCK CRITERIA