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

Zorzenon, Davide; Zaiets, Nataliia; Raisch, Jörg

doi:10.1016/j.ifacol.2023.10.038

IFAC-PapersOnLine

2023

DOI: 10.1016/j.ifacol.2023.10.038

|View full text |Cite

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

Davide Zorzenon,

Nataliia Zaiets,

Jörg Raisch

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article3

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Switched max-plus linear-dual inequalities: cycle time analysis and applications

Zorzenon,

Komenda,

Raisch

2024

Discrete Event Dyn Syst

View full text Add to dashboard Cite

P-time event graphs are discrete event systems suitable for modeling processes in which tasks must be executed in predefined time windows. Their dynamics can be represented by max-plus linear-dual inequalities (LDIs), i.e., systems of linear dynamical inequalities in the primal and dual operations of the max-plus algebra. We define a new class of models called switched LDIs (SLDIs), which allow to switch between different modes of operation, each corresponding to a set of LDIs, according to a sequence of modes called schedule. In this paper, we focus on the analysis of SLDIs when the considered schedule is fixed and either periodic or intermittently periodic. We show that SLDIs can model a wide range of applications including single-robot multi-product processing networks, in which every product has different processing requirements and corresponds to a specific mode of operation. Based on the analysis of SLDIs, we propose algorithms to compute: i. minimum and maximum cycle times for these processes, improving the time complexity of other existing approaches; ii. a complete trajectory of the robot including start-up and shut-down transients.

show abstract

Switched max-plus linear-dual inequalities: cycle time analysis and applications

Zorzenon,

Komenda,

Raisch

2024

Discrete Event Dyn Syst

View full text Add to dashboard Cite

show abstract

Exact and heuristic max-plus strategies for makespan minimization in permutation flow shops with time-window constraints

Robillard,

Peschel,

Zorzenon

et al. 2024

IFAC-PapersOnLine

View full text Add to dashboard Cite

Using Markov Decision Process over Local Modular Supervisors for Planning Problems

Sarsur,

Alves,

Pena

2024

IFAC-PapersOnLine

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

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

Cited by 3 publications

References 12 publications

Switched max-plus linear-dual inequalities: cycle time analysis and applications

Switched max-plus linear-dual inequalities: cycle time analysis and applications

Exact and heuristic max-plus strategies for makespan minimization in permutation flow shops with time-window constraints

Using Markov Decision Process over Local Modular Supervisors for Planning Problems

Contact Info

Product

Resources

About