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

Mohammad M. Aldurgam () and Moustafa Elshafei ()
Additional contact information
Mohammad M. Aldurgam: King Fahd University of Petroleum and Minerals
Moustafa Elshafei: King Fahd University of Petroleum and Minerals

A chapter in Operations Research Proceedings 2010, 2011, pp 379-384 from Springer

Abstract: 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.

Keywords: Dynamic Programming; Dynamic Programming Algorithm; Maintenance Schedule; Time Epoch; Horizontal Pattern (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-20009-0_60

Ordering information: This item can be ordered from
http://www.springer.com/9783642200090

DOI: 10.1007/978-3-642-20009-0_60

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().