Solving the combinatorial puzzle
Novel Algorithms for Multiobjective Optimization of Maintenance Scheduling To find optimal schedules for maintenance is a difficult combinatorial puzzle that belongs to the class of so-called NP-hard problems, for which only algorithms with an exponentially growing running time are known. Researchers in the CIMPLO project managed to model maintenance scheduling as a multiobjective problems and …