Abstract

Physical resequencing and virtual resequencing are two general forms of sequence adjustment in the context of mixed-model assembly lines. Selectivity banks can be used to physically change the production sequences on a mixed-model assembly line. Virtual resequencing can be incorporated into this process in order to improve the reordering outcomes. This paper introduces a problem of car resequencing before final assembly via selectivity banks that incorporates virtual resequencing. A mathematical programming formulation is presented to describe this integrated resequencing problem. The objective is to minimize the number of violations of sequencing rules within the downstream sequence. Several heuristic approaches for the car storage and retrieval processes are proposed, based on which nine integrated resequencing algorithms are developed. Computational experiments show that incorporating virtual resequencing nearly always obtains noticeably better results than pure physical resequencing. In addition, one of the presented algorithms, denoted by IR9, which jointly applies a chromosome based fill procedure and an integrated release procedure, performs best.

Full Text
Paper version not known

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 call

Disclaimer: 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.