Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
