We consider a mixture of for-profit and non-profit requests that share multiple resources at random consumption rates. The revenue from fulfilling for-profit requests is used to cross-subsidize the cost of non-profit operations, and we aim to maximize the number of completed non-profit service requests. We consider two problems that respectively optimize resource allocation and service schedules, and employ chance constraints to restrict the probability of undesired outcomes such as resource over-utilization and service delay. For the allocation model, we propose three approximations of the chance-constrained program, and derive their variants to allow variable resource capacities. For the scheduling model, we derive a mixed-integer linear programming reformulation and develop a two-phase algorithm that separately decides allocation decisions and the start time of each service request. We conduct numerical studies on randomly generated instances of non-profit surgery planning to demonstrate the computational results of different models, and the impact of varying parameters and cross-subsidization on non-profit operations.