English  |  正體中文  |  简体中文  |  Items with full text/Total items : 65421/65421 (100%)
Visitors : 22282450      Online Users : 160
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/71228


    Title: 類似Kiva系統之訂單分配於揀貨工作站的相關問題探討
    Authors: 黃獎緯;Huang,Jiang-Wei
    Contributors: 工業管理研究所
    Keywords: Kiva作業系統;訂單分配法則;訂單分配之揀貨工作站挑選法則;訂單分配之空儲存格挑選法則;Kiva Operation System;Order Assigning Problem;Order of Picking Workstation Selecting Problem;Order of Cell Selecting Problem
    Date: 2016-07-26
    Issue Date: 2016-10-13 12:13:40 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 近年來受到全球化的影響且網路科技迅速發展,使市場競爭日趨激烈,因此物流產業為了因應這種變化,必須找出更有效率的作業模式,以符合消費市場的需求,並提供顧客更高的服務水準與品質。因此若是能使用恰當的作業策略來降低從進貨到出貨的作業時間與成本,這對提升物流中心的運作效率將有非常顯著之影響。
    Kiva作業為目前物流作業中最新的一種策略,是指在Kiva作業上不用像以往傳統物流那樣以「人到貨」的方式,而是顛覆了傳統物流上的做法,改變為「貨到人」的方式來搬運商品,以致於能夠大幅降低在整個作業流程上人力與時間的成本。如此便可使品項從進貨到出貨的時間最小化,因此Kiva作業適合需要快速處理的緊急訂單,且能夠將訂單從訂單池選取進行揀取和包裝後,再出貨。
    本研究針對使用Kiva作業系統(Kiva Operation System)之物流中心所延伸出的三種決策問題進行探討,並分別提出相對應的訂單分配、訂單分配之工作站挑選,與訂單分配之空儲存格挑選問題,再利用模擬實驗所得到的數據,比較在此環境下的總系統執行時間(Total System Time)、總延後時間(Total Tardiness),以判斷哪種因子組合對訂單分配之揀貨工作站與訂單分配之空儲存格的挑選法則作業效率有較顯著的提升。
    ;Because our country has impacted by globalization, and the network is growing fast, the market competition is becoming more and more fierce. For those reasons, the logistics industry has to find an operation mode which was more effective to conform to the demands of consumer market, and provide a higher level and quality to customers. Thus, reducing the operation time and costs from receiving to shipping by using appropriate operation strategy will significantly impact the effectiveness of logistic center.
    Kiva operation is a latest strategy of logistics operations, which means that Kiva operation changed to handle goods in "goods to person" method instead of in "person to goods" method, which subverted the measures in traditional logistics, resulting in big reduction in the cost and time of the whole operation process. Therefore, the time from purchase to shipment can be minimized. For those characteristics, Kiva operation is particularly suitable for urgent orders and it can pick orders from order pool to pick and pack, and then ship.
    This research aims to three issues of Kiva Operation System, which were order assigning problem rule, order of workstation selecting problem rule, and order of cell selecting problem rule. Finally, in this environment, comparing the data by Total System Time, Total Tardiness, which were obtained by simulation experiments, to know which combination of the rules will performs better.
    Appears in Collections:[工業管理研究所 ] 博碩士論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML433View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明