Summary: This paper deals with a flow-shop scheduling problem in which weights of jobs and break-down times of machines are considered. A heuristic approach method to find an optimal or near optimal sequence minimizing the total weighted mean production flow-time for the problem has been discussed.