Simulation Comparisons of Dispatching Rules for Multitasking Workers in Flow Shop with High Priority Job Orders
碩士 === 朝陽大學 === 工業工程與管理系碩士班 === 88 === High priority job orders are often encountered by manufacturing industries. They need to be taken care of to improve a company’s customer service level as well as to keep the ordinary orders shipping on schedule. This research exams the feasibility...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2000
|
Online Access: | http://ndltd.ncl.edu.tw/handle/82996242747309153891 |
id |
ndltd-TW-088CYUT0031010 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-088CYUT00310102015-10-13T11:53:30Z http://ndltd.ncl.edu.tw/handle/82996242747309153891 Simulation Comparisons of Dispatching Rules for Multitasking Workers in Flow Shop with High Priority Job Orders 多能工派工法則之模擬比較-以面臨緊急訂單之流線型生產系統為例 ChengHung Hsu 徐政宏 碩士 朝陽大學 工業工程與管理系碩士班 88 High priority job orders are often encountered by manufacturing industries. They need to be taken care of to improve a company’s customer service level as well as to keep the ordinary orders shipping on schedule. This research exams the feasibility and effects of adding multitasking workers to the production line when high priority job orders occur. By computer simulation, it is found that adding multitasking workers indeed increase the system’s ability in handling these high priority job orders. This research further compares the dispatching rules for dynamically assigning multitasking workers in the production line when high priority job orders occur. Two responses variables, the cycle time for the high priority job order and the system’s recovery time, are chosen and a 25 factorial experiment is conducted using computer simulation. The simulation results show that LSF (Last Station First) is the best dispatching rule when the cycle time for the high priority job order is considered. On the other hand, when considering the best when the system’s recovery time, LNQ (Length of the Queue) is the best when process times at each station is normally distributed and FASFS (First Arrived in the System, First Serve) is the best when it’s exponentially distributed. H.C. Horng 洪弘祈 2000 學位論文 ; thesis 0 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 朝陽大學 === 工業工程與管理系碩士班 === 88 === High priority job orders are often encountered by manufacturing industries. They need to be taken care of to improve a company’s customer service level as well as to keep the ordinary orders shipping on schedule.
This research exams the feasibility and effects of adding multitasking workers to the production line when high priority job orders occur. By computer simulation, it is found that adding multitasking workers indeed increase the system’s ability in handling these high priority job orders.
This research further compares the dispatching rules for dynamically assigning multitasking workers in the production line when high priority job orders occur. Two responses variables, the cycle time for the high priority job order and the system’s recovery time, are chosen and a 25 factorial experiment is conducted using computer simulation. The simulation results show that LSF (Last Station First) is the best dispatching rule when the cycle time for the high priority job order is considered. On the other hand, when considering the best when the system’s recovery time, LNQ (Length of the Queue) is the best when process times at each station is normally distributed and FASFS (First Arrived in the System, First Serve) is the best when it’s exponentially distributed.
|
author2 |
H.C. Horng |
author_facet |
H.C. Horng ChengHung Hsu 徐政宏 |
author |
ChengHung Hsu 徐政宏 |
spellingShingle |
ChengHung Hsu 徐政宏 Simulation Comparisons of Dispatching Rules for Multitasking Workers in Flow Shop with High Priority Job Orders |
author_sort |
ChengHung Hsu |
title |
Simulation Comparisons of Dispatching Rules for Multitasking Workers in Flow Shop with High Priority Job Orders |
title_short |
Simulation Comparisons of Dispatching Rules for Multitasking Workers in Flow Shop with High Priority Job Orders |
title_full |
Simulation Comparisons of Dispatching Rules for Multitasking Workers in Flow Shop with High Priority Job Orders |
title_fullStr |
Simulation Comparisons of Dispatching Rules for Multitasking Workers in Flow Shop with High Priority Job Orders |
title_full_unstemmed |
Simulation Comparisons of Dispatching Rules for Multitasking Workers in Flow Shop with High Priority Job Orders |
title_sort |
simulation comparisons of dispatching rules for multitasking workers in flow shop with high priority job orders |
publishDate |
2000 |
url |
http://ndltd.ncl.edu.tw/handle/82996242747309153891 |
work_keys_str_mv |
AT chenghunghsu simulationcomparisonsofdispatchingrulesformultitaskingworkersinflowshopwithhighpriorityjoborders AT xúzhènghóng simulationcomparisonsofdispatchingrulesformultitaskingworkersinflowshopwithhighpriorityjoborders AT chenghunghsu duōnénggōngpàigōngfǎzézhīmónǐbǐjiàoyǐmiànlínjǐnjídìngdānzhīliúxiànxíngshēngchǎnxìtǒngwèilì AT xúzhènghóng duōnénggōngpàigōngfǎzézhīmónǐbǐjiàoyǐmiànlínjǐnjídìngdānzhīliúxiànxíngshēngchǎnxìtǒngwèilì |
_version_ |
1716849636765859840 |