Abstract: The number of available parking spaces is sometimes fewer, sometimes more. Managers aim to rent out as many parking spaces as possible within a certain time to maximize revenue. However, there are two problems in parking spaces scheduling. Firstly, existing methods overlook the combination assignment of reservation users to obtain the optimal assignment scheme. Secondly, existing scheduling methods fail to optimize parking resources to maximize the potential revenue. To solve these problems, this paper proposes a parking space scheduling method based on combinatorial allocation. Firstly, within a 12-hour scheduling cycle, orders and parking spaces are viewed as agents and roles, respectively. Secondly, multiple orders are formed into a combined agent. The combined agent is viewed as assignment elements to prevent inefficient resource utilization caused by the scattered order assignments. Then, qualification values of combined agents for roles are calculated, with higher parking fees leading to higher values. For combined agents with the same fees, fewer time intervals result in higher evaluation values. By this way, the number of interval time periods can be reduced while obtaining the current optimal benefit. Finally, the combined agents are assigned with the objective of obtaining the maximum qualification values. Simulation experiments verify that the proposed method can reduce the number of parking interval time and obtain the assignment scheme with the best profit.