In this paper, we present and describe a new version of the Minimum Cost Flow Problem (MCFP). This version is the Minimum Cost Flow Time-Windows Problem with Interval Bounds and Flows (MCFTWPIBF). The MCFTWPIBF is a combinatorial optimization and an NP-hard problem. The minimum cost flow time-windows problem with interval data can be using two minimum cost flow time-windows problems with crisp data. In this paper, the idea of Ghiyasvand was extended the minimum cost flow time-windows problem with interval-valued lower, upper bounds and flows. Also, this work is extended to network with fuzzy lower, upper bounds and flows. A representation example network is given.