勤益科大機構典藏:Item 987654321/7158
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 2928/5721 (51%)
造访人次 : 1499338      在线人数 : 234
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncut.edu.tw/handle/987654321/7158


    题名: The Scheduling of Maintenance Service for a Family of Machines of Multi-branch Firm
    作者: 黃嘉彥
    贡献者: 資訊管理(學)系
    日期: 2012-03
    上传时间: 2018-01-30 14:53:11 (UTC+8)
    摘要: Purpose
    – It is not uncommon that a multi‐branch firm has all its branches maintaining the same group of machines from a maintenance department. Clearly there are potential opportunities to reduce costs by coordinating the joint maintenance among the branches. The purpose of this paper is to optimally coordinate the maintenance schedule of machines of multi‐branch firms to save the maintenance cost incurred.

    Design/methodology/approach
    – A search algorithm is proposed that proceeds the searching through the junction points within the lower and upper bounds of the search range. An example is given to illustrate the method.

    Findings
    – The optimality structure of this problem is explored and it is asserted that the optimal cost is piece‐wise convex. Based on theoretical results, an effective search algorithm is derived that can efficiently determine the maintenance frequencies for a family of machines of multi‐branch firm.

    Practical implications
    – A well‐planned maintenance schedule can not only bring down the cost but also raise the utilization rate of a family of machines. Numerical results show that the whole maintenance system can obtain significant cost savings from the coordination policy.

    Originality/value
    – In response to branches adopting coordinated maintenances, the maintenance manager providing the maintenances to the branches faces a scheduling problem of how to minimize its total costs. This is an area that has received little attention in the literature. By utilizing the theoretical results, an efficient search algorithm that solves the optimal solution for this problem is proposed.
    關聯: Journal of Quality
    显示于类别:[資訊管理系(研發與科技管理研究所)] 【資訊管理系】期刊論文

    文件中的档案:

    没有与此文件相关的档案.



    检视Licence

    在NCUTIR中所有的数据项都受到原著作权保护.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈