Shared more. Cited more. Safe forever.
    • advanced search
    • submit works
    • about
    • help
    • contact us
    • login
    View Item 
    •   MOspace Home
    • University of Missouri-Columbia
    • Graduate School - MU Theses and Dissertations (MU)
    • Theses and Dissertations (MU)
    • Theses (MU)
    • 2016 Theses (MU)
    • 2016 MU theses - Access restricted to MU
    • View Item
    •   MOspace Home
    • University of Missouri-Columbia
    • Graduate School - MU Theses and Dissertations (MU)
    • Theses and Dissertations (MU)
    • Theses (MU)
    • 2016 Theses (MU)
    • 2016 MU theses - Access restricted to MU
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.
    advanced searchsubmit worksabouthelpcontact us

    Browse

    All of MOspaceCommunities & CollectionsDate IssuedAuthor/ContributorTitleIdentifierThesis DepartmentThesis AdvisorThesis SemesterThis CollectionDate IssuedAuthor/ContributorTitleIdentifierThesis DepartmentThesis AdvisorThesis Semester

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular AuthorsStatistics by Referrer

    Genetic algorithm for batch sequencing

    Indapurkar, Gunjan Chandrakant
    View/Open
    [PDF] research.pdf (2.319Mb)
    [PDF] public.pdf (2.723Kb)
    Date
    2016
    Format
    Thesis
    Metadata
    [+] Show full item record
    Abstract
    [ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT REQUEST OF AUTHOR.] Batch sequencing is an elementary function in production control in a manufacturing facility due to increased customer expectations and fierce global as well as domestic competition. In the light of increasing global competition, companies are increasingly required to deliver made-to-order products in shorter production time and on schedule. As a result, production planning and control is under constant pressure to shorten lead times and meet due dates. However, in this research study we do not follow an earliest due date approach. We weigh all batches equally and try to find an optimal sequence with least changeover time. Most production planning and control problems are computationally inflexible in terms of an optimal solution and as a result different dispatching rules are used. Yet due to the current advances in computer and information technology, it is virtually viable and cost effective to implement an optimization based sequencing strategy that utilizes comprehensive information in order to improve shop performance. Optimal batch sequencing is attributed to cost reduction and profit maximization. As sequencing relates to operational cost and performance it directly affects an organization's survivability. Batch sequencing can be approached by Travelling Salesman Problem (TSP) framework. In this case, batch insertion sequence represents cities. The cost/distance matrix represents the changeover times. The TSP framework may consist of precedence constraints, reflecting that certain batch must be inserted before others. TSP has a starting node (location) which is a home location. In this thesis, we do not account for precedence constraints in order to get a least cost sequence. In this research, we develop a genetic algorithm (GA) that generates a least cost sequence. The results obtained by GA are validated by mathematical model branch & bound algorithm.
    URI
    https://hdl.handle.net/10355/65984
    Degree
    M.S.
    Thesis Department
    Industrial and manufacturing systems engineering (MU)
    Rights
    Access to files is limited to the University of Missouri--Columbia.
    Collections
    • Industrial and Manufacturing Systems Engineering electronic theses and dissertations (MU)
    • 2016 MU theses - Access restricted to MU

    Send Feedback
    hosted by University of Missouri Library Systems
     

     


    Send Feedback
    hosted by University of Missouri Library Systems