Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Management / 管理學院
  3. Information Management / 資訊管理學系
  4. An Analysis on the Effects of Dispatching Rules on Overtime Models
 
  • Details

An Analysis on the Effects of Dispatching Rules on Overtime Models

Date Issued
2005
Date
2005
Author(s)
Lin, Yi-Chien
DOI
zh-TW
URI
http://ntur.lib.ntu.edu.tw//handle/246246/54379
Abstract
Due to the rapidly changing demand, corporations now put more emphasis on improving their workflow in order to provide better products and services with lower prices. The production scheduling problem is especially complicated and difficult to manage. Although current software and information systems, such as ERP, are designed to solve this kind of problem, they neglect the limitations of capacity, and usually produce infeasible planning results. At present, most scheduling problems are job shop related. Dispatching rules, which are easy to understand and efficient, are one of the most common approaches to solving job shop scheduling problems. Nevertheless, the results generated by dispatching rules do not necessarily meet the goals of production scheduling. For instance, the due date of products may not be satisfied. In this case, having employees work overtime has been commonly used as a way to meet the delivery schedules, which is different from previous research where the scheduling problem was only solved by dispatching rules. In this study, the effects of different initial solutions resulting from different dispatching rules on overtime models are explored. The shortcomings of previous overtime models are also identified and a modified overtime model is proposed in this work. The experimental setting takes five experimental factors into account: the number of machines, the number of jobs, the maximum processing time, the due date allowance factor, and the maximum daily overtime. Fifty-five dispatching rules are evaluated both before and after overtime by three performance metrics: total tardiness, number of tardy jobs, and mean flow time. The experimental results show that most dispatching rules that outperform others before overtime usually also perform well after overtime. On the other hand, by using more overtime, some of the dispatching rules that perform poorly before overtime can catch up with those performing well before overtime. However, the cost of overtime cannot be neglected. In the case of tighter due date settings, we observe that SPT.TWK and SPT.TWKR outperform other dispatching rules both before and after overtime in terms of the three performance metrics. In future implementations, our model could be extended to different production systems, such as flow shops. In addition, the cost and efficiency of overtime compared to normal working hours could be considered.
Subjects
零工式生產排程
派工法則
加班模式
job shop scheduling
dispatching rule
overtime model
Type
other
File(s)
Loading...
Thumbnail Image
Name

ntu-94-R92725046-1.pdf

Size

23.31 KB

Format

Adobe PDF

Checksum

(MD5):a9c4f8f8c6fa89790d1caf022a28c705

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science