Abstract
This paper focuses on the disassembly sequencing, which is the problem of determining the disassembly level and the corresponding disassembly sequence for a product at its end-of-life with the objective of maximizing the overall profit. Parallel disassembly and sequence-dependent operation times are considered by developing an extended process graph obtained from a transformation of a conventional AND/OR graph. Then, an integer programming formulation is developed with precedence constraints that allows its resolution with standard techniques. Finally, an optimal solution is obtained, with a reasonable amount of computation time, for an industrial application of a subassembly of a copy machine.
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.
