IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-642-20009-0_60.html
   My bibliography  Save this book chapter

Optimal Maintenance Scheduling of N-Vehicles with Time-Varying Reward Functions and Constrained Maintenance Decisions

In: Operations Research Proceedings 2010

Author

Listed:
  • Mohammad M. Aldurgam

    (King Fahd University of Petroleum and Minerals)

  • Moustafa Elshafei

    (King Fahd University of Petroleum and Minerals)

Abstract

In this paper we consider the problem of scheduling the maintenance of fleet of N different vehicles over a given planning horizon T. Each vehicle is assumed to have different time-dependant productivity, mean time to repair, and cost of repair with possible limitations on the maximum number of vehicles that can be repaired at a given time epoch. The objective is to maximize the total productivity minus the cost of repairs. We propose an efficient dynamic programming (DP) approach to the solution of this problem. The constraints are translated into feasible binary assignment patterns. The dynamic programming considers each vehicle as a state which takes one of possible feasible patterns. The algorithm seeks to maximize the objective function subject to specific constrains on the sequence of the selected patterns. An example is given and the DP solution is compared with the best of 50,000 randomly selected feasible assignments. The developed algorithm can also be applied to a factory of N production machines, power generators, or car rental.

Suggested Citation

  • Mohammad M. Aldurgam & Moustafa Elshafei, 2011. "Optimal Maintenance Scheduling of N-Vehicles with Time-Varying Reward Functions and Constrained Maintenance Decisions," Operations Research Proceedings, in: Bo Hu & Karl Morasch & Stefan Pickl & Markus Siegle (ed.), Operations Research Proceedings 2010, pages 379-384, Springer.
    • Handle: RePEc:spr:oprchp:978-3-642-20009-0_60
    DOI: 10.1007/978-3-642-20009-0_60
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:oprchp:978-3-642-20009-0_60. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.