English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 78852/78852 (100%)
造訪人次 : 35093873      線上人數 : 749
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/71102


    題名: 勤業務專責分工下消防人員每日勤務排班最佳模式之研究;The Study of the Best Model for Firefighter’s Daily Duty Scheduling based on the Division of Labor with Specific Responsibility
    作者: 楊雅玲;YANG,YA-LING
    貢獻者: 土木工程學系在職專班
    關鍵詞: 消防;勤業務專責分工;0-1整數規劃;最佳化;LINGO;firefighting;the division of labor with specific responsibility;0-1 integer programming;optimization;LINGO
    日期: 2016-07-12
    上傳時間: 2016-10-13 12:06:24 (UTC+8)
    出版者: 國立中央大學
    摘要: 根據新北市消防統計年報指出,民國94年至103年間,受理有效火災救護派遣案件數,由153501件增至262067件。消防署統計資料也指出,截至民國105年初,全國消防機關總編制員額18,262人,總預算員額15,507人,但實際員額13,980人。消防署在面對勤業務量驟增及人力不足的雙重困境下,近年增設特考名額,期能在短期內補足人力。然而新進同仁自招考至下單位,需一年半至兩年半的時間,而在人力補足前,唯有規劃一個兼顧公平、合理、人性化的每日勤務排班系統,才能讓同仁在繁重的勤業務下稍作喘息。目前外勤消防單位勤務排班皆以人工指派,其缺點包含費時、勤務分配不均、同仁休息時間不足以及無法考量勤務權重分配等,加上本研究單位為一消防勤業務專責分工單位,隊員編制包含特搜隊員及專責救護隊員,因不同編制隊員於勤務排班上各有不同的限制,使得勤務排班更加費時。
    本研究為研擬一最佳化勤務排班系統,納入各排班限制、考量同仁休息時間,以及按勤務類別之勞逸程度分配各勤務權重,使得每位同仁能夠達到勤務量權重分配平均,並符合每種勤務在該時段內應有的人力限制。因消防外勤單位每日勤務類別及上班人數並不固定,通常須於前一晚才能確認次日之勤務類別,因此,本研究為探討每日勤務班表之編排。本研究以每日服勤人員及每日勤務類別為基底,利用數學0-1整數規劃來編排數學限制條件,使用LINGO 12.0為工具,找到最佳化的公平編排,並將本研究模式與人工排班作比較,期能規劃出最適合本研究單位之勤務班表。
    ;According to Firefighting Statistics, New Taipei City, reception of effective fire rescue and dispatch increased from 153,501 to 262,067 cases during the period of 2005~2014. National Fire Agency’s statistical data also pointed that total authorized number of personnel is 18,262 persons and actual personnel 13,980 persons out of total budgeted personnel 15,507 persons in national firefighting authorities as of early 2016.Facing double dilemmas of the surge in service quantity and the shortage of manpower, National Fire Agency (NFA) has added admission quota for professional and technical exams in recent years, expecting to make up manpower in the short term. However, it usually takes one and half to two and half years for new personnel from recruitment via examination to assignment. Before making up the shortage, the planning of a daily duty scheduling system on fair, reasonable and humanized basis should be the only way to help our firefighters relieve stress from heavy duties. Currently, field firefighting unit’s duty scheduling is based on job assignment, which the shortcomings include time-consuming, uneven distribution of duty, shortage of break time and no consideration of duty weight distribution, etc.; furthermore, the unit in this study is a unit based on the division of labor with specific responsibility for firefighting duty, including the organizations of search & rescue team members and specialized medical service team members. Team members in different organizations are limited to different duty scheduling, causing more time will be spent on the scheduling.
    In order to plan the best model of duty scheduling system, this study incorporated each scheduling limitation, consideration of firefighter’s break time and duty weight distributed by labor and rest degree on duty category basis, allowing each person to reach equal division of duty weight and each duty to meet required manpower limitation during the period.Field firefighting unit has not fixed its daily duty category and number of people in duty hours, which duty category on the next day was usually confirmed the night before. Consequently, for the discussion of daily duty scheduling, this study based on daily on-duty personnel and daily duty category applied math. 0-1 integer programming to schedule mathematical constraint, using LINGO 12.0 as a tool to find out the optimized fair scheduling, and comparing this research model with job assignment for planning the most suitable duty scheduling table for the unit in this study.
    顯示於類別:[土木工程學系碩士在職專班] 博碩士論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML476檢視/開啟


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