Optimal Management of the Machine Repair Problem with Working Vacation: Newton-Quasi method
碩士 === 國立中興大學 === 應用數學系所 === 96 === This thesis studies the M/M/1 machine repair problem with working vacation which the server works with different repair rates rather than completely terminates repair during a vacation period. We assume that the server begins a working vacation when the system is...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/32365348583722340949 |
id |
ndltd-TW-096NCHU5507022 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-096NCHU55070222016-05-11T04:16:24Z http://ndltd.ncl.edu.tw/handle/32365348583722340949 Optimal Management of the Machine Repair Problem with Working Vacation: Newton-Quasi method 含有會調整工作效率的機器修理問題之最佳管理-牛頓法 Wei-Lun Chen 陳韋綸 碩士 國立中興大學 應用數學系所 96 This thesis studies the M/M/1 machine repair problem with working vacation which the server works with different repair rates rather than completely terminates repair during a vacation period. We assume that the server begins a working vacation when the system is empty. The failure times, repair times, and vacation times are all assumed to be exponentially distributed. We use the computer software to compute steady-state probabilities and several system performance measures. A cost model is derived to determine the optimal values of the number of operating machines and two different repair rates simultaneously, and maintain the system availability at a certain level. We use the two methods direct search method and Newton-Quasi method to find the global minimum value until the system availability constraint is satisfied. Two numerical examples are provided to illustrate the Newton-Quasi method. 王國雄 2008 學位論文 ; thesis 26 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立中興大學 === 應用數學系所 === 96 === This thesis studies the M/M/1 machine repair problem with working vacation which the server works with different repair rates rather than completely terminates repair during a vacation period. We assume that the server begins a working vacation when the system is empty. The failure times, repair times, and vacation times are all assumed to be exponentially distributed. We use the computer software to compute steady-state probabilities and several system performance measures. A cost model is derived to determine the optimal values of the number of operating machines and two different repair rates simultaneously, and maintain the system availability at a certain level. We use the two methods direct search method and Newton-Quasi method to find the global minimum value until the system availability constraint is satisfied. Two numerical examples are provided to illustrate the Newton-Quasi method.
|
author2 |
王國雄 |
author_facet |
王國雄 Wei-Lun Chen 陳韋綸 |
author |
Wei-Lun Chen 陳韋綸 |
spellingShingle |
Wei-Lun Chen 陳韋綸 Optimal Management of the Machine Repair Problem with Working Vacation: Newton-Quasi method |
author_sort |
Wei-Lun Chen |
title |
Optimal Management of the Machine Repair Problem with Working Vacation: Newton-Quasi method |
title_short |
Optimal Management of the Machine Repair Problem with Working Vacation: Newton-Quasi method |
title_full |
Optimal Management of the Machine Repair Problem with Working Vacation: Newton-Quasi method |
title_fullStr |
Optimal Management of the Machine Repair Problem with Working Vacation: Newton-Quasi method |
title_full_unstemmed |
Optimal Management of the Machine Repair Problem with Working Vacation: Newton-Quasi method |
title_sort |
optimal management of the machine repair problem with working vacation: newton-quasi method |
publishDate |
2008 |
url |
http://ndltd.ncl.edu.tw/handle/32365348583722340949 |
work_keys_str_mv |
AT weilunchen optimalmanagementofthemachinerepairproblemwithworkingvacationnewtonquasimethod AT chénwéilún optimalmanagementofthemachinerepairproblemwithworkingvacationnewtonquasimethod AT weilunchen hányǒuhuìdiàozhěnggōngzuòxiàolǜdejīqìxiūlǐwèntízhīzuìjiāguǎnlǐniúdùnfǎ AT chénwéilún hányǒuhuìdiàozhěnggōngzuòxiàolǜdejīqìxiūlǐwèntízhīzuìjiāguǎnlǐniúdùnfǎ |
_version_ |
1718264679231389696 |