A Tactical Planning Model for Mixed-Model Electronics Assembly Operations

Published Online:https://doi.org/10.1287/opre.47.3.395

References

  • Ahmadi J., Ahmadi R., Matsuo H., Tirupati D. Component fixture positioning/sequencing for printed circuit board assembly with concurrent operations. Oper. Res. (1995) 43:444–457LinkGoogle Scholar
  • Ahmadi J., Grotzinger S., Johnson D. Component allocation and partitioning for a dual delivery placement machine. Oper. Res. (1988) 36:176–191LinkGoogle Scholar
  • Ahmadi R. H., Ahmadi J. Component fixture positioning/sequencing for printed circuit board assembly with concurrent operations. Oper. Res. (1995) 43:444–457LinkGoogle Scholar
  • Ahmadi R. H., Kouvelis P. An analytical framework for the design of electronic assembly lines: Comparison of different design approaches. (1992) Presented at ORSA/TIMS Joint National Meeting, San Francisco, CA, NovemberGoogle Scholar
  • Ahmadi R. H., Matsuo H. A mini-line approach for pull production. (1992) . Working paper, Anderson Graduate School of Management, UCLA, Los Angeles, CAGoogle Scholar
  • Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Askin R. G., Dror M., Vakharia A. J. Printed circuit board family grouping and component allocation for a multimachine, openshop assembly cell. Naval Res. Logist. (1994) 41:587–608CrossrefGoogle Scholar
  • Baker K. R.Introduction to Sequencing and Scheduling (1974) (John Wiley and Sons, New York) Google Scholar
  • Balakrishnan A., Vanderbeck F. Setup optimization and workload balancing for mixed-model electronics assembly operations. (1993) . Working paper 3551-93-MSA, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
  • Ball M. O., Magazine M. J. Sequencing of insertions in printed circuit board assemblies. Oper. Res. (1988) 36:192–201LinkGoogle Scholar
  • Bard J. F., Clayton R. W., Feo T. A. Optimizing machine setup and component insertion in printed circuit board assembly. (1989) . Working paper, University of Texas, Austin, TXGoogle Scholar
  • Barnhart C., Johnson E. L., Anbil R., Hatay L. Solution techniques for long-haul crew assignment problem. (1992) . Working paper, Computational Optimization Center, Georgia Institute of Technology, Atlanta, GAGoogle Scholar
  • Carmon T. F., Maimon O. Z., Dar-El E. M. Group set-up for printed circuit board assembly. Intl. J. Prod. Res. (1989) 27:1795–1810CrossrefGoogle Scholar
  • CPLEX Optimization, IncUsing the CPLEX Linear Optimizer (1994) (Ver. 3.0. CPLEX Optimization, Inc., Incline Village, NV) Google Scholar
  • Dantzig G. B., Wolfe P. Decomposition principle for linear programs. Oper. Res. (1960) 8:101–111LinkGoogle Scholar
  • Daskin M. S., Maimon O., Shtub A. A branch and bound algorithm for grouping components in printed circuit board production. (1991) . Working paper, Department of Civil Engineering, Northwestern University, Evanston, ILGoogle Scholar
  • Desrochers M., Desrosiers J., Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. (1992) 40:342–354LinkGoogle Scholar
  • DeWitte J. The use of similarity coefficients in production flow analysis. Int. J. Prod. Res. (1980) 18:505–514Google Scholar
  • Drezner Z., Nof S. On optimizing bin packing and insertion plans for assembly robots. IIE Trans. (1984) 16:262–270CrossrefGoogle Scholar
  • Fisher M. L. The Lagrangian relaxation method for solving integer programming problems. Management Sci. (1981) 27:1–18LinkGoogle Scholar
  • Francis R. L., Hamacher H. W., Lee C.-Y., Yeralan S. On automating robotic assembly workplace planning. (1989) . Research report, Industrial and Systems Engineering Department, University of Florida, Gainesville, FLGoogle Scholar
  • Frenk J. B. G., Rinnooy Kan A. H. G. The asymptotic optimality of the LP rule. Math. Oper. Res. (1987) 12:241–54LinkGoogle Scholar
  • Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman and Company, San Francisco, CA) Google Scholar
  • Gavish B., Seidmann A., Mital A. Printed circuit boards assembly automation—Formulations and algorithms. Recent Developments in Production Research (1988) (Elsevier Science Publishers, B. V. Amsterdam, The Netherlands) 624–635Google Scholar
  • Jain S., Johnson M. E., Safai F. Implementing setup optimization on the shop floor. Oper. Res. (1996) 44:843–851LinkGoogle Scholar
  • King J. R. Machine-component grouping in production flow analysis: An approach using a rank order clustering algorithm. Int. J. Prod. Res. (1980) 18:213–232CrossrefGoogle Scholar
  • King J. R., Nakornchai V. Machine-component group formation in group technology: Review and extension. Int. J. Prod. Res. (1982) 20:117–133CrossrefGoogle Scholar
  • Lasdon L. S.Optimization Theory for Large Systems (1970) (Macmillan, New York) Google Scholar
  • Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Dempster M. A. H., Lenstra J. K., Rinnooy Kan A. H. G. Recent developments in deterministic sequencing and scheduling: A survey. Deterministic and Stochastic Scheduling (1982) (Reidel, Dodrecht) CrossrefGoogle Scholar
  • Lofgren C. B., McGinnis L. F. Optimizing electronics assembly system. IIE Elec. Assembly Conf. (1986) September 29–October 1,1986(Boston, MA)Google Scholar
  • Magnanti T. L., Wong R. T. Accelerating benders decomposition: Algorithmic enhancement and model selection criteria. Oper. Res. (1981) 27:464–482LinkGoogle Scholar
  • McGinnis L. F., Ammons J. C., Carlyle M., Cranmer L., Depuy G. W., Ellis K. P., Tovey C. A., Xu H. Automated process planning for printed circuit card assembly. IIE Trans. (1992) 24:18–29CrossrefGoogle Scholar
  • Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (John Wiley and Sons, New York) CrossrefGoogle Scholar
  • Prasad R. P.Surface Mount Technology: Principles and Practice (1989) (Van Nostrand Reinhold, New York) Google Scholar
  • Rajagopalan R., Batra J. L. Design of cellular production systems: A graph-theoretic approach. Int. J. Prod. Res. (1982) 13:567–579CrossrefGoogle Scholar
  • Vance P. H., Barnhart C., Johnson E. L., Nemhauser G. L. Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optim. Appl. (1994) 3:111–130CrossrefGoogle Scholar
  • Vanderbeck F. A decomposition approach for parallel machine assignment and setup minimization in electronics assembly. (1993) . Unpublished thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
  • Vanderbeck F., Wolsey L. A. An exact algorithm for IP column generation. (1994a) . CORE Discussion paper 9419, Université Catholique de Louvain, Louvain-la-Neuve, BelgiumGoogle Scholar
  • Vanderbeck F., Wolsey L. A. Optimal placement of add-drop multiplexer. (1994b) . CORE Discussion paper 9479, Université Catholique de Louvain, Louvain-la-Neuve, BelgiumGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.