Abstract
A simple assembly line balancing problem is considered provided that number m of working stations is fixed. In such a problem, denoted as SALBP-2, it is necessary to minimize a cycle time for processing a partially ordered set of operations V = [1, 2,…, n] on a set of m linearly ordered (working) stations. An initial vector of the processing times t = (t1, t2,… ,tn) of the operations V is given. And for each automated operation processing time ti cannot vary during a life cycle of the assembly line. For a subset V V of the manual operations j ∈ V, processing times tj may vary, since different workers may have different skill, experience, etc. We investigate a stability of the optimal line balance of the simple assembly line with respect to simultaneous variations of processing times tj of manual operations j ∈ V. An optimal line balance is stable if its optimality is preserved for any sufficiently small variations of processing times tj, j ∈ V. We propose an enumerative algorithm and a program in C++ for constructing all the stable optimal line balances for the problem SALBP-2. Computational results for the modified benchmark instances have been presented.
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.
