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

In this paper, an industrial bakery shop is modeled by switched max-pluslinear-dual inequalities (SLDIs). SLDIs are timed discrete event systemssuitable for describing flow shops with time-window constraints and switchingoperating modes, where each mode corresponds to a job type. We consider thescheduling problem of minimizing the makespan of the shop, and we show that theapplication of methods based on the max-plus algebra leads to a faster solutioncompared to standard techniques. The results of the paper are general, in thesense that they can be applied to any permutation flow shop with time-windowconstraints.

Switched max-plus linear-dual inequalities for makespan minimization: the case study of an industrial bakery shop