Abstract
This paper aims at proposing a model for flow-shops with setup times in dioid algebra. Since this algebra is efficient and generic, the absence of a general systematic technique available for such systems using this tool is a strong motivatioui for investigating the issue. (Min, +) constraints are developed to handle resource sharing of flow-shops. In particular, the part that can be modeled by a Timed Event Graph induce (Min, +)-linear equations which are constrained regarding to the resource availability. The proposed algebraic model is proved to describe exactly the exhaustive set of possible behaviors of dealt systems. An example of flow-shop with setup times is modeled using our approach.
Sign-in/Register to access full text options 
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.
