Institute for Systems Research Technical Reports

Permanent URI for this collectionhttp://hdl.handle.net/1903/4376

This archive contains a collection of reports generated by the faculty and students of the Institute for Systems Research (ISR), a permanent, interdisciplinary research unit in the A. James Clark School of Engineering at the University of Maryland. ISR-based projects are conducted through partnerships with industry and government, bringing together faculty and students from multiple academic departments and colleges across the university.

Browse

Author: search.filters.author.Proth, J.M.Subject: search.filters.subject.plant layout

Search Results

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item
    Minimization of Acquisition and Operational Costs in Horizontal Material Handling System Design
    (1995) Herrmann, Jeffrey W.; Ioannou, George; Minis, Ioannis; Proth, J.M.; ISR
    This paper considers the problem of minimizing the fixed cost of acquiring material handling transporters and the operational cost of material transfer in a manufacturing system. This decision problem arises during manufacturing facility design, and is modeled using an integer programming formulation. Two efficient heuristics are developed to solve it. Computational complexity, worst-case performance analysis, and extensive computational tests are provided for both heuristics. The results indicate that the proposed methods are well suited for large-scale manufacturing applications.
  • Thumbnail Image
    Item
    Design of Material Flow Networks in Manufacturing Facilities
    (1994) Herrmann, Jeffrey W.; Ioannou, George; Minis, Ioannis; Nagi, R.; Proth, J.M.; ISR
    In this paper we consider the design of material handling flow paths in a discrete parts manufacturing facility. A fixed-charge capacitated network design model is presented and two efficient heuristics are proposed to determine near-optimal solutions to the resulting NP- hard problem. The heuristics are tested against an implicit enumeration scheme used to obtain optimal solutions for small examples. For more realistic cases, the solutions of the heuristics are compared to lower bounds obtained by either the linear programming relaxation of the mixed integer program, or an iterative dual ascent algorithm. The results obtained indicate that the heuristics provide good solutions in reasonable time on the average. The proposed methodology is applied to design the flow paths of an existing manufacturing facility. The role of the flow path network problem in the integrated shop design is also discussed.
  • Thumbnail Image
    Item
    Class: Computerized LAyout Solutions Using Simulated Annealing
    (1990) Minis, Ioannis; Harhalakis, George; Jajodia, Satish K.; Proth, J.M.; ISR
    A new method (Computerized LAyout Solutions using Simulated annealing - CLASS) that considers the inter-cell and intra-cell layout problems in a cellular manufacturing environment is presented. It addresses the relative placement of equidimensional manufacturing entities within a discrete solution space in an attempt to minimize the total material flow (cost) between these entities. An approach to accommodate the relative sizes of the entities is also presented. The method is based on Simulated Annealing, which has been successfully applied for the solution of combinatorial problems. A major advantage of this technique is the insensitivity of the final solution to the initial conditions. In addition, some important practical issues such as intra-cell layout of machines in pre-determined configurations (e.g. row-wise or circular arrangements), have been addressed. Several comparisons were made with some of the existing approaches for facility layout, such as CRAFT, HC63-66, etc. that yielded results of equal or better quality for each of eight classical test problems.
  • Thumbnail Image
    Item
    Manufacturing Cell Design Using Simulated Annealing: an Industrial Application
    (1990) Harhalakis, George; Proth, J.M.; Xie, X.L.; ISR
    In this paper, we give a brief summary of simulated annealing procedures used to solve combinatorial optimization problems. We then present the manufacturing cell design problem which consists of designing cells of limited size in order to minimize inter- cell traffic. We show how to use a SA approach to obtain a good, if not optimum, solution to this problem. Finally, we apply this approach to an industrial problem and compare the results to the ones obtained using the so-called twofold heuristic algorithm.