Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
