Switched max-plus linear-dual inequalities for makespan minimization: the case study of an industrial bakery shop
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2022
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914312362131456 |
|---|---|
| author | Zorzenon, Davide Zaiets, Nataliia Raisch, Jörg |
| author_facet | Zorzenon, Davide Zaiets, Nataliia Raisch, Jörg |
| contents | In this paper, an industrial bakery shop is modeled by switched max-plus linear-dual inequalities (SLDIs). SLDIs are timed discrete event systems suitable for describing flow shops with time-window constraints and switching operating modes, where each mode corresponds to a job type. We consider the scheduling problem of minimizing the makespan of the shop, and we show that the application of methods based on the max-plus algebra leads to a faster solution compared to standard techniques. The results of the paper are general, in the sense that they can be applied to any permutation flow shop with time-window constraints. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_07601 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Switched max-plus linear-dual inequalities for makespan minimization: the case study of an industrial bakery shop Zorzenon, Davide Zaiets, Nataliia Raisch, Jörg Optimization and Control Systems and Control In this paper, an industrial bakery shop is modeled by switched max-plus linear-dual inequalities (SLDIs). SLDIs are timed discrete event systems suitable for describing flow shops with time-window constraints and switching operating modes, where each mode corresponds to a job type. We consider the scheduling problem of minimizing the makespan of the shop, and we show that the application of methods based on the max-plus algebra leads to a faster solution compared to standard techniques. The results of the paper are general, in the sense that they can be applied to any permutation flow shop with time-window constraints. |
| title | Switched max-plus linear-dual inequalities for makespan minimization: the case study of an industrial bakery shop |
| topic | Optimization and Control Systems and Control |
| url | https://arxiv.org/abs/2211.07601 |