An adaptation of SH heuristic to the location set covering problem

Article Abstract:

A surrogate heuristic algorithm (RS) was developed which was found to be for superior in solving location set covering problem than the SH and CMA/FMC algorithms currently in use. The algorithm was developed using the Lagrangean relaxation with the solution of surrogate problems algorithm. Test conducted on the RS algorithm showed the model to be superior in performance to the CMA/FMC algorithm and in speed to the SH algorithm.

Heuristic programming

---

Generalized p-Center problems: complexity results and approximation algorithms

Article Abstract:

A model was developed to assess two alternative p-Center problems: the Pair p-Center and the Set p-Center problems. Research into the problem is meant to provide solutions to bottleneck problems. The approximation algorithm developed from the model tested NP-completeness and demonstrated the existence of polynomial time approximation algorithms.

---

The relationship between preventive maintenance and manufacturing system performance

Article Abstract:

Research is presented concerning the lack of priority which is often given to preventive maintenance of pant and machinery. The impact of maintenance activities on the performance of manufacturing systems is discussed.

Queuing theory, Maintenance

Similar abstracts:

• Abstracts: Getting global valuation right. Coping with valuations in emerging markets
• Abstracts: A note on the equivalence of two heuristics to minimize total tardiness. A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: a case of small common due date
• Abstracts: Australian airport drama. Airport privatisation - the Australian experience. More Australian airports
• Abstracts: Fine points of pleasant travel. Bargaining power. Pedestrian explorers discover a different path in Guangzhou
• Abstracts: Crest: the big test. Preaching to the unconverted. No ordinary Joe

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.