Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/44939
DC FieldValue
dc.titleAge-maintenance of an M/G/1 production system
dc.contributor.authorCo, Henry C.
dc.contributor.authorAraar, Abdelaziz
dc.date.accessioned2013-10-10T04:38:12Z
dc.date.available2013-10-10T04:38:12Z
dc.date.issued1991
dc.identifier.citationCo, Henry C.,Araar, Abdelaziz (1991). Age-maintenance of an M/G/1 production system. International Journal of Production Research 29 (10) : 2135-2149. ScholarBank@NUS Repository.
dc.identifier.issn00207543
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/44939
dc.description.abstractMany production systems can be modelled as queueing systems. This paper examines the age-maintenance of an M/G/1 queue that is subject to random service interruptions. The frequency of breakdowns can be reduced by scheduling preventive maintenance at shorter intervals. However, the system is down while preventive maintenance is being performed. Too frequent preventive maintenance can be costly, and the disruption on operation, excessive. Determining the preventive maintenance interval that minimizes long-run expected operating costs, where the down times due to preventive maintenance and repair are taken into account explicitly, is a very complex problem. A special case of the problem in which the traffic intensity is high is investigated. We formulate the optimization problem as a nonlinear program, and provide theorems for determining the minimum-cost preventive maintenance interval.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentDECISION SCIENCES
dc.description.sourcetitleInternational Journal of Production Research
dc.description.volume29
dc.description.issue10
dc.description.page2135-2149
dc.description.codenIJPRB
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.