中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/64793
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 80990/80990 (100%)
造访人次 : 41649208      在线人数 : 1400
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/64793


    题名: 負荷平均排班最佳化模式之研究-以模具加工廠為例
    作者: 林淑梅;Lin,Shu-mei
    贡献者: 土木工程學系在職專班
    关键词: 模具廠;排班;0-1整數規劃;最佳化公平指派模式;Lingo;molding factory;work shift;0-1 integer planning;optimized fair work assignment model;Lingo
    日期: 2014-07-15
    上传时间: 2014-10-15 14:25:04 (UTC+8)
    出版者: 國立中央大學
    摘要: 摘 要
    我國模具產業自光復初期起,一直是伴隨著國內工業發展之腳步而逐步茁壯,直至民國七十年初,有鑑於模具產業對工業發展之重要性日益彰顯,政府乃將模具產業納入「策略性工業適用範圍」,大力推動模具工業之發展,以配合相關工業產品之外銷策略,由於當前製造業大多屬24小時加工生產模式,且人工經驗排班作業一直是各企業單位常態性耗時問題,因此經常令決策者花費大量時間在溝通協調、安排整合調度,最後其排班結果亦非最佳化之公平指派。
    本研究因應現實需求及公平性,係以模具加工廠之製程人員,於固定週期內從事日夜班勤務需求量之製程人員排班做為本研究範圍,先將現實問題之所有限制資源予以量化,進而轉換並建構數學模型,並以0-1整數規劃模式為架構,輸入撰寫Lingo 8.0套裝軟體進行模擬測試,輸出求解其最佳化負荷平均之指派模式,以驗證本研究最佳化模式所產生之排程結果,確實優於人工經驗排班,且更具效率及公平性。並依此目標值之相關參數調整及增減限制條件來推演方案分析,藉此求得所有製程人員之負荷平均排班,幫助決策者適度規劃及人力安排,以防止產生勞工超時及過勞現象致違反勞動檢查機關之規定,更可做為各製造業之管理人力指派參考。
    ;Abstract
    The mold and die industry can be traced back to as early as the beginning of democracy in the nation’s history, and has matured along with the national industrial development. In view of the growing significance of the mold and die industry on the development of the nationwide industry, in the 1980’s, the government incorporated the mold and die industry into the “Strategic Industry Applicable Scope” and promoted the development of the mold and die industry while cooperating with export strategies for related industrial products. Due to the fact that most of the manufacturers at the present time utilize the manufacturing model of 24-hour operations, and manual work shift operations have always been time-consuming that pose problems to a great number of corporate departments, as a result, decisions makers often spend a great deal of time on communications and work shift arrangements despite the fact that the outcome of the finalized work shift may still yet to be an optimal or fair arrangement.
    In this research, in order to meet the actual demands and standard of fairness, the factors of the process personnel of a molding factory, the demands on the work shifts of the personnel participating in daytime and nighttime shifts in a fixed weekly period are used as the scope of this research. First, all of the limited resources associated with the actual problem in practice are quantified for conversion and constructing mathematical models. In addition, the 0-1 integer planning model is used as a structural framework and is inputted and written into the Lingo 8.0 software package to perform simulations and tests. This is followed by outputting the results for obtaining the optimized work assignment model with loading averages in order to verify the arrangement result generated by the most optimal model in this research, to ascertain if it is indeed advantageous over the manual work shift arrangement and is of higher efficiency and fairness. Furthermore, related parameter adjustments and limitation criteria modification according to such objective values are used to simulate the solution analysis such that the loading average work shift for all process personnel can be obtained in order to assist the decision makers to suitably plan and arrange the work force. Any working overtime and over loading of work violating the regulations specified by the work force inspection agency can be prevented, and this research can be further used as a reference of work force assignment for managers of all manufacturers.
    显示于类别:[土木工程學系碩士在職專班] 博碩士論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML634检视/开启


    在NCUIR中所有的数据项都受到原著作权保护.

    社群 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 ©   - 隱私權政策聲明