勤益科大機構典藏:Item 987654321/7158
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 2928/5721 (51%)
Visitors : 374911      Online Users : 470
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncut.edu.tw/handle/987654321/7158


    Title: The Scheduling of Maintenance Service for a Family of Machines of Multi-branch Firm
    Authors: 黃嘉彥
    Contributors: 資訊管理(學)系
    Date: 2012-03
    Issue Date: 2018-01-30 14:53:11 (UTC+8)
    Abstract: 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.
    Relation: Journal of Quality
    Appears in Collections:[Department of Information Management] 【資訊管理系】期刊論文

    Files in This Item:

    There are no files associated with this item.



    All items in NCUTIR are protected by copyright, with all rights reserved.


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