Optimal repairman assignment in two symmetric maintenance models

DOI10.1016/0377-2217(94)00265-EzbMath0905.90087OpenAlexW2049075307MaRDI QIDQ1388894

Ger Koole

Publication date: 11 June 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00265-e

zbMATH Keywords

dynamic programmingdelayed informationmaintenance modelsparallel groups of identical componentsrepairman schedulingsmallest group policy

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (1)

A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors

Cites Work

• Control of a random walk with noisy delayed information
• New results on the single server queue with a batch markovian arrival process
• On the Assignment of Customers to Parallel Queues
• On the optimal assignment of servers and a repairman
• Optimal Repair of a Series System
• Optimal control of arrivals to queues with delayed queue length information
• Marked point processes as limits of Markovian arrival streams

This page was built for publication: Optimal repairman assignment in two symmetric maintenance models