In a competitive situation today, having ascheduling process and sequencing of efficient operations as a necessity forsurvival in the commercial space is inevitable. Research in this area is veryextensive and has attracted many researchers in this field. One of the areaswhere it is possible to use scheduling is the battery manufacturing plant. Thisresearch is motivated by a scheduling problem found in the wet charge andpacking department. In this research, we discuss the scheduling ofjobs with incompatible families on 3 stages flexible flowshop with block andbatch processing machines where first and third stage include one discreteprocessing machine and second stage includes m batch processing machines. Thisresearch is motivated by a scheduling problem found in the wet charge andpacking department. We attempt to minimize total weighted tardiness of orders. At first, Given the lack of examination of this problem in thesubject literature, three mathematical models are presented for this problem. Becausethis scheduling problem is NP-hard, we suggest an heuristic algorithm and variableneighborhood search algorithm with an initial EDD (VNSEDD) and a variableneighborhood search algorithm with an initial heuristic algorithm (VNSH) andmemetic algorithm (MA) for solving the problem. Finally, these algorithms arecompared with each other. The computational results on sample problems showthat the VNSH algorithm is capable of solving issues up to 1200 orders and 15machines so the average gap from the the best solution is about 2.3%, and theMA is able to solving issues up to dimensions 1200 orders and 15 machines sothe average gap from the the best solution is about 8.4%. The computationalresults illustrate that a better performance of the VNSH alghorithm has betterperformance compare to three other algorithms.