Polynomial-time computability of the maximum forcing number for elementary polyomino graphs

Let $G$ be an elementary polyomino graph, meaning that every edge of $G$ lies in some perfect matching.

Xu et al.'s conjecture. The maximum forcing number of $G$ can be computed in polynomial time.

The source says that this conjecture can now be confirmed, so the claim is a theorem rather than an open problem.