• 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

    Scheduling flexible flow lines with sequence dependent setup times

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    azu_td_3023515_sip1_m.pdf
    Size:
    5.164Mb
    Format:
    PDF
    Download
    Author
    Kurz, Mary Elizabeth
    Issue Date
    2001
    Keywords
    Engineering, Industrial.
    Advisor
    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
    This dissertation examines scheduling in flexible flow lines with sequence-dependent setup times to minimize makespan. This type of manufacturing environment is found in industries such as printed circuit board and automobile manufacture. Lower makespans can be associated with more efficient use of resources. Poor scheduling when sequence-dependent setup times exist can negatively impact productivity. As a building block, minimizing makespan in parallel identical machines with sequence-dependent setup times is examined. Several heuristics are compared empirically using statistical analysis. Experimental results indicate that a heuristic based on the Insertion Heuristic for the Travelling Salesman Problem is effective. Subsequently, minimizing makespan in flexible flow lines with sequence-dependent setup times is considered. An integer program that incorporates all aspects of the problem is formulated. Due to the NP-hard nature of the problem, heuristic methods are considered. The heuristics, based on greedy methods, flow line methods, the Insertion Heuristic for the Travelling Salesman Problem and genetic algorithms are compared empirically using statistical analysis. The heuristics are designed to take advantage of the flow line nature of the problem, the parallel machine nature and the combinatorial features of the problem. Problem data is generated in order to evaluate the heuristics. The characteristics are chosen to reflect those used by previous researchers. An effective lower bound is created in order to evaluate the heuristics. A random keys genetic algorithm is found to be very effective for the problems eyed. In addition, several extensions based on backwards pass of the schedule and focusing on the bottleneck stage are proposed and examined. These proved to be ineffective approaches but yielded insight regarding what features of schedule are important. Most significantly, the first stage is very important in determining the quality of the subsequent schedule. The heuristics considered here focus on setting a schedule for one stage and then considering the next. Areas for future research include developing methods of scheduling job-by-job and examination of branch and bound methods to find optimal solutions, aided by effective lower bounds and theorems regarding schedule domination.
    Type
    text
    Dissertation-Reproduction (electronic)
    Degree Name
    Ph.D.
    Degree Level
    doctoral
    Degree Program
    Graduate College
    Systems and Industrial Engineering
    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.