Algorithms for Computing Repair Schedules in Probabilistic Environments.
Abstract
This paper considers an organization that repairs or overhauls a single type of complex equipment such as aircraft transmitters, navigational computers, or electrical generating units. The organization inventories the repaired assets to meet probabilistic demands for serviceable items. Additional serviceable stocks may also be purchased from outside vendors if the repair process does not satisfy all demands. The paper considers the problem of computing jointly optimal procurement and repair schedules for such a system. Cost elements explicitly considered include set-up costs, learning curve effects, expediting and inventory holding costs, and penalties for incurring shortages or for modifying the schedule from previously established levels. Multi-period lead times, obsolescence and time-discounting effects are also considered.
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1977
- Accession Number
- ADA049554
Entities
People
- W. Steven Demmy
Organizations
- Wright State University