In this study we will present an improved version of the Bowman-White zero-one integer programming formulation of an assembly line balancing problem. We will demonstrate that in solving the above problem, certain steps in Geoffrion's 0–1 integer programming algorithm can be simplified or eliminated. Computational results are given which indicate that the proposed algorithm is faster than the present exact methods.
No takes yet. Share an insight, caveat, or question.
Thangavelu et al. (1971) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: