Please login to be able to save your searches and receive alerts for new content matching your search criteria.
In this paper, we address the scheduling issues in a class of maintenance, repair and overhaul systems. By considering all key characteristics such as disassembly, material recovery uncertainty, material matching requirements, stochastic routings and variable processing times, the scheduling problem is formulated into a simulation optimization problem. To solve this difficult problem, we developed two hybrid algorithms based on nested partitions method and optimal computing budged allocation technology. Asymptotic convergence of these two algorithms is proved and numerical results show that the proposed algorithms can generate high quality solutions which outperform the performance of many heuristics.