IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v24y1996i2p217-227.html
   My bibliography  Save this article

A linear programming model to manage the maintenance backlog

Author

Listed:
  • Taylor, R. W.

Abstract

One of the keys to a successful maintenance program in a large manufacturing industry is the ability to complete repairs in a timely fashion. A poor maintenance program impacts productivity, costs, customer satisfaction, and worker esteem. Since a substantial portion of maintenance labor-hours are assigned to non-routine work orders, it is important to process these orders promptly and effectively. A linear programming model has been developed to cost-effectively allocate labor crews to different prioritized work orders. The linear programming model gives consideration to different craft areas, such as electrical, mason, and so on, as well as to the prioritization of work orders. Also, the use of overtime work and the assignment of a special allocable projects crew is considered. The model formulation is continually updated and rerun as new work orders enter the system, old orders are completed, and the time horizon changes for the pending work orders. An example of the model is presented as applied to an aluminum smelting plant, where the model is being run successfully on a weekly basis.

Suggested Citation

  • Taylor, R. W., 1996. "A linear programming model to manage the maintenance backlog," Omega, Elsevier, vol. 24(2), pages 217-227, April.
    • Handle: RePEc:eee:jomega:v:24:y:1996:i:2:p:217-227
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(95)00056-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rui Jiang & Michael Kim & Viliam Makis, 2012. "A Bayesian model and numerical algorithm for CBM availability maximization," Annals of Operations Research, Springer, vol. 196(1), pages 333-348, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:24:y:1996:i:2:p:217-227. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.