Abstract
This paper deals with the design of a reconfigurable modular manufacturing line. The studied line is composed of a fixed number of modular machines, each of which having a limited number of spots where modules can be placed. Such a line is able to handle different products. Switching from one product configuration to another requires the line to be reconfigured by adding, moving or removing some modules. The objective of this paper is to minimize the total number of modules necessary to produce a given set of products. To do this, a first extended MILP formulation is proposed based on a module generation algorithm. Then, a MILP-based heuristic approach, which uses a module filtering algorithm, is suggested to address the studied problem. Preliminary results and a comparison between the two developed approaches are finally presented and discussed.
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.
