2016/03/07 by Robin H. Pearce, Pearce, Robin H., Michael Forbes +1
Engineering · Business, Management and Accounting · #Reliability and Maintenance Optimization #Advanced Queuing Theory Analysis
paper · pdf · doi:10.48550/arxiv.1603.02378
We consider a problem concerning a network and a set of maintenance requests\nto be undertaken. We wish to schedule the maintenance in such a way as to\nminimise the impact on the total throughput of the network. We apply\ndisaggregated Benders cuts and lazy constraints to solve the problem to\noptimality, as well as exploring the strengths and weaknesses of the technique.\nWe prove that our Benders cuts are pareto optimal. Solutions to the LP\nrelaxation also provide further valid inequalities to reduce total solve time.\nWe implement these techniques on simulated data presented in previous papers,\nand compare our solution technique to previous methods and a direct MIP\nformulation. We prove optimality in many problem instances that have not\npreviously been proven.\n