• Login
    View Item 
    •   Home
    • UA Graduate and Undergraduate Research
    • UA Theses and Dissertations
    • Dissertations
    • View Item
    •   Home
    • UA Graduate and Undergraduate Research
    • UA Theses and Dissertations
    • Dissertations
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UA Campus RepositoryCommunitiesTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournalThis CollectionTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournal

    My Account

    LoginRegister

    About

    AboutUA Faculty PublicationsUA DissertationsUA Master's ThesesUA Honors ThesesUA PressUA YearbooksUA CatalogsUA Libraries

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Cell formation based on operation requirements and machine capability.

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    azu_td_9603387_sip1_m.pdf
    Size:
    3.193Mb
    Format:
    PDF
    Description:
    azu_td_9603387_sip1_m.pdf
    Download
    Author
    Zhou, Ming
    Issue Date
    1995
    Committee Chair
    Askin, Ronald G.
    
    Metadata
    Show full item record
    Publisher
    The University of Arizona.
    Rights
    Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
    Abstract
    In this dissertation study, the problem of forming manufacturing cells is investigated with a focus on the cell formation methodology based on operation requirements and machine capability. Manufacturing economics, cell independence, within-cell layout and machine utilization are incorporated into the methodology. First, the formation of independent flow-line cells based on operation sequence is considered. Algorithms for sequence constrained part family formation are developed. A shortest path model with node-augmentation and an implicit enumeration algorithm are proposed to identify the optimal machine sequence and capacity, the result is compared with a greedy heuristic. Formation of general Group Technology (GT) cells without sequence constraints is then investigated. Parts are grouped into families according to the operation types required. A mathematical formulation is presented for machine group selection problem. This integer model takes into account fixed machine cost, variable production cost, setup cost, and intracell material handling cost. For the problems with moderate size, the model can be solved to optimality by a standard package such as Cplex. Heuristic procedures are also developed for machine group selection problem, which can identify good feasible solutions more efficiently. Finally, improvements on the methodology are made with an effort to integrate the decisions regarding part grouping and machine selection. Experimental results are provided to compare the performance and computational efficiency of different algorithms/heuristics. The effect of changing cost structure on the heuristic performance is also investigated for the case without sequence constraints through statistical experiment design. Future research is discussed at the conclusion of this dissertation.
    Type
    text
    Dissertation-Reproduction (electronic)
    Degree Name
    Ph.D.
    Degree Level
    doctoral
    Degree Program
    Systems and Industrial Engineering
    Graduate College
    Degree Grantor
    University of Arizona
    Collections
    Dissertations

    entitlement

     
    The University of Arizona Libraries | 1510 E. University Blvd. | Tucson, AZ 85721-0055
    Tel 520-621-6442 | repository@u.library.arizona.edu
    DSpace software copyright © 2002-2017  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.