Abstract
This paper deals with two most important problems, from both practical and theoretical standpoints, arising in sequencing mixed-model assembly lines. Such lines have become core components of modern repetitive manufacturing, and just-in-time (JIT) manufacturing in particular. One problem is to keep the usage rate of all parts fed into the final assembly as constant as possible (the “level-scheduling problem”), while the other is to keep the line's workstation loads as constant as possible (the “car-sequencing problem”). In this paper the combined problem is formulated as a single-integer programming model. The LP-relaxation of this model is solved by column-generation techniques. The results of an experimental evaluation show that the lower bounds are tight.
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.
