There is an increasing demand for Internet core nodes to have (1) quality-of-service (QoS) guarantees and (2) higher switching capacity. The combined input and output queued (CIOQ) switching has been shown to be a promising solution to meet such demand. However, many of the proposed scheduling algorithms for a CIOQ switch cannot be practically implemented due to problems from scalability and complexity. This paper shows how the virtual time reference system (VTRS) can be applied to packet scheduling in a CIOQ switch. The VTRS is a unifying scheduling framework to provide scalable support for guaranteed services. In the context of packet scheduling for a CIOQ switch, we show that the use of VTRS can eliminates both the scalability and complexity problems associated with many of the scheduling algorithms proposed in the literature. More important, we show that in term of of providing end-to-end guaranteed service, packet scheduling using VTRS for a CIOQ switch has the same performance as an output queued (OQ) switch employing weighted fair queueing (WFQ) scheduler.