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

Smoothing the workloads among the stations of an already installed assembly line is one of the major objectives in assembly line (re-)balancing. In order to find a feasible task-station assignment that distributes the total workload as equal as possible, two exact task-oriented branch-and-bound algorithms have recently been proposed. In this paper, we systematically analyse their effectiveness in solving the workload smoothing problem on simple assembly lines. In our experiments, we also examine the performance of a state-of-the-art mathematical programming solver and a ‘combined’ exact branch-and-bound procedure that integrates components of the two algorithms from the literature. In terms of theory, we show the equivalence of two recently developed local lower bounding arguments and suggest a slight improvement of the bound. We also propose an enhanced feasibility test.

On the performance of task-oriented branch-and-bound algorithms for workload smoothing in simple assembly line balancing