Mathematical Programming: Series A and B
A cutting plane algorithm for a clustering problem
Mathematical Programming: Series A and B
Facets of the clique partitioning polytope
Mathematical Programming: Series A and B
Modelling and strong linear programs for mixed integer programming
Algorithms and model formulations in mathematical programming
Mathematical Programming: Series A and B
Mathematical Programming: Series A and B
Solving binary cutting stock problems by column generation and branch-and-bound
Computational Optimization and Applications
Formulations and valid inequalities for the node capacitated graph partitioning problem
Mathematical Programming: Series A and B
The node capacitated graph partitioning problem: a computational study
Mathematical Programming: Series A and B - Special issue on computational integer programming
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Cliques and clustering: A combinatorial approach
Operations Research Letters
Optimal spares and preventive maintenance frequencies for constrained industrial systems
Computers and Industrial Engineering
| Hi-index | 0.00 |
The inventory of spare parts that a firm holds depends on the number of working parts and age of the equipment to be serviced, the expected failure rate associated with each working part, and the acceptable level of service. We model the problem of consolidation of spare parts to reduce overall inventory as an integer program with a nonlinear objective function. A linear reformulation of this model is obtained that helps solve some practical instances. A more compact implicit formulation is developed and solved using a specialized branch-and-price technique. We also demonstrate how this specialized branch-and-price technique is modified to devise a very effective heuristic procedure with a prespecifiable guarantee of quality of solution produced. This provides a practical and efficient methodology for maintenance spare consolidation.