I'm not sure you completely understand IDA*. IDA* uses repeated limited depth depth-first-searches to reduce the memory requirement associated with A* (where A* normally uses more of a breadth-first-search (BFS)-like process).
If you modify IDA* to use an open and closed list, you'll probably go back to the BFS-like process, so you'll essentially be back to A*.