Résumé: Abstract: This paper survey highlight on algorithms for the well-known problem called consecutive ones block minimization. This is a NP-Hard problem which tries to reach to a feasible solution in polynomial time. All approaches seem to be based on two subsidiaries which start by searching how to obtain the consecutive ones propriety, second explore the approximation theory. This can be done by the introduction of notion of approximability preserving reduction. The aim of this survey is to present and discusses the last development of the structural aspects of the polynomial time approximation theory for this problem, it’s includes several recent results about completeness in approximability classes and interesting applications.

Résumé: In this paper, we present some tools helping us to make decision i.e., designing an optimal inspection measure. The approach is developed in search proposed by Hemodialysis center health, an implementation and computation program is developed. This problem has also applications in the theories of reliability and can be modeled by a Markov chain structure; this can be done by parallel series or series parallel coherent structures. The algorithms are encouraging and measure can be found

Résumé: We present a polynomial-time heuristic for the Consecutive Block Minimization Problem such that the solutions generated do not differ from optimal by more than 50%.