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 discusses the U-shaped assembly line balancing problem in case of stochastic processing time. The problem is formulated using chance-constrained programming, and the greedy randomized adaptive search procedure is used to solve the problem. In order to prove the efficiency of the proposed algorithm, 71 problems taken from well-known benchmarks are solved and compared with the theoretical lower bound, and 13 of them were compared with another approach used to solve the same problem in another paper, which is beam search. The results show that 59 problems are the same as the theoretical aspiration lower bound. In addition, the results of 11 of 13 problems compared with beam search are the same, and the results of two problems are better than beam search. The t-test statistics is applied and showed that there is no significance difference between the proposed algorithm and the theoretical lower bound; thus, the proposed algorithm shows efficiency when compared with the aspired values of the theoretical lower bound.

A Greedy Randomized Adaptive Search for Solving Chance-Constrained U-Shaped Assembly Line Balancing Problem