Assembly System Design: A Branch and Cut Approach

References

• Balas E. On the facial structure of scheduling polyhedra. Math. Programming Stud. (1985) 24:179–218Crossref, Google Scholar
• Baybars I. A survey of exact algorithms for the simple assembly line balancing problem. Management Sci. (1986) 32(8):909–932Link, Google Scholar
• Buxey G. M., Slack N. D., Wild R. Production flow line system design—A review. AIIE Trans. (1973) 5:37–48Crossref, Google Scholar
• Crowder H., Johnson E. L., Padberg M. Solving large-scale zero-order linear programming problems. Oper. Res. (1983) 31:803–834Link, Google Scholar
• Garey M. R., Johnson D. S. Computers and intractability: A guide to the theory of NP-completeness. (1979) (W. H. Freeman and Company, New York) Google Scholar
• Ghosh S., Gagnon R. J. A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems. Internat. J. Production Res. (1989) 27:637–670Crossref, Google Scholar
• Graves S. C., Lamar B. W. An integer programming procedure for assembly system design problems. Oper. Res (1983) 31:522–545Link, Google Scholar
• Graves S. C., Redfield C. H. Equipment selection and task assignment for multiproduct assembly system design. Internat. J. Flexible Manufacturing Systems (1988) 1:31–50Crossref, Google Scholar
• Grotschel M., Jünger M., Reinelt G. A cutting plane algorithm for the linear ordering problem. Oper. Res. (1984) 32:1195–1220Link, Google Scholar
• Hackman S. T., Magazine M. J., Wee T. S. Fast, effective algorithms for simple assembly line balancing problems. Oper. Res. (1989) 37:916–924Link, Google Scholar
• Hoffmann T. R. Assembly line balancing: A set of challenging problems. Internat. J. Production Res. (1990) 28:1807–1815Crossref, Google Scholar
• Johnson E. L., Padberg M. W. A note on the knapsack problem with special ordered sets. Oper. Res. Lett. (1981) 1:18–22Crossref, Google Scholar
• Lee H. F., Johnson R. V. A line-balancing strategy for designing flexible assembly systems. Internat. J. Flexible Manufacturing Systems (1991) 3:91–120Crossref, Google Scholar
• Leung J. M. Y., Magnanti T. L. Valid inequalities and facets of the capacitated plant location problem. Math. Programming (1989) 44:271–291Crossref, Google Scholar
• Martello S., Toth P.Knapsack Problems, Algorithms and Computer Implementations (1989) (John Wiley, New York) Google Scholar
• Nemhauser G. L., Sigismondi G. A strong cutting plane/branch-and-bound algorithm for node packing. J. Oper. Res. Soc. (1992) 43:443–457Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (John Wiley, New York) Crossref, Google Scholar
• Padberg M. W. Covering packing, and knapsack problems. Ann. Discrete Math. (1979) 4:265–287Crossref, Google Scholar
• Padberg M. W., Van Roy T. J., Wolsey L. A. Valid linear inequalities for fixed charge problems. Oper. Res. (1985) 33:842–861Link, Google Scholar
• Pinnoi A., Wilhelm W. E. Assembly system design: Valid inequalities and facets for the line balancing problem. (1994) . Working paper, Department of Industrial Engineering, Texas A&M University, College Station, TexasGoogle Scholar
• Pinnoi A., Wilhelm W. E. A branch and cut approach for workload smoothing on assembly lines. ORSA J. Comput. (1997a) . In printGoogle Scholar
• Pinnoi A., Wilhelm W. E. A family of hierarchical models for assembly system design. J. Production Res. (1997b) 35(1):253–280Crossref, Google Scholar
• Pinto P. A., Dannenbring D. G., Khumawala B. M. Assembly line balancing with processing alternatives: An application. Management Sci. (1983) 29:817–830Link, Google Scholar
• Soni A. H., Soni A. H. Research needs and opportunities in flexible assembly systems. Flexible Assembly Systems (1990) (The American Society of Mechanical Engineers, Dearborn, MI) 221–228Google Scholar
• Talbot F. B., Patterson J. H., Gehrlein W. V. A comparative evaluation of heuristic line balancing techniques. Management Sci. (1986) 32:430–454Link, Google Scholar
• Wolsey L. A. Valid inequalities for 0–1 knapsacks and MIPs with generalized upper bound constraints. Discrete Appl. Math. (1990) 29:251–261Crossref, Google Scholar