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)
    • 2010 Theses (MU)
    • 2010 MU theses - Freely available online
    • View Item
    •   MOspace Home
    • University of Missouri-Columbia
    • Graduate School - MU Theses and Dissertations (MU)
    • Theses and Dissertations (MU)
    • Theses (MU)
    • 2010 Theses (MU)
    • 2010 MU theses - Freely available online
    • 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

    Relation-based item slotting

    Wutthisirisart, Phichet, 1984-
    View/Open
    [PDF] public.pdf (4.974Kb)
    [PDF] short.pdf (46.83Kb)
    [PDF] research.pdf (700.5Kb)
    Date
    2010
    Format
    Thesis
    Metadata
    [+] Show full item record
    Abstract
    The cost of warehouse operations contributes approximately 20% of the total cost in a supply-chain system, and the cost of the picking process can be as high as 65% of the warehousing cost. Therefore, there is an incentive to improve the picking process in order to reduce the overall cost of the supply-chain system. The item assignment policy which allocates items to storage locations is one of the main decision processes that is aimed at lowering the travelling cost, which is normally considered as waste. Existing methods like the Cube-per-Order-Index (COI) and the volume-based strategy focus on the picking of items individually, the fact that multiple items can be picked in one single route is not considered. In this research, the concept of linear placement that has been used in computer science is adopted to create the Minimum Delay Algorithm (MDA). The method includes the relationship among items in order to generate the item storage layout that minimizes the total walking distance of order pickers. MDA was tested against other methods like CLP, COI, and OOS with 30 study cases. The results show that MDA can provide up to a 40% travel distance saving. Finally, MDA is combined with CLP, which is an iterative improvement method, in order to further improve the solution.
    URI
    http://hdl.handle.net/10355/9270
    https://doi.org/10.32469/10355/9270
    Degree
    M.S.
    Thesis Department
    Industrial engineering (MU)
    Rights
    OpenAccess.
    This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 License.
    Collections
    • 2010 MU theses - Freely available online
    • Industrial and Manufacturing Systems Engineering electronic theses and dissertations (MU)

    Send Feedback
    hosted by University of Missouri Library Systems
     

     


    Send Feedback
    hosted by University of Missouri Library Systems