摘要：The paper is concerned with scheduling traffic on a single track between two stations which generate requests for transportation with different release times. These requests are served by a fleet of identical vehicles, each of which can serve (carry) several requests for transportation simultaneously. The single track, used by the vehicles, does not permit traffic in both directions simultaneously. The presented polynomial-time algorithms are based on dynamic programming.
