Optical grids can integrate geographically distributed resources more efficiently to support applications because of characteristics of optical networks. The essential aspect of optical grid applications is scheduling. By scheduling, multiple optical grid applications from different users can be executed on one optical grid. This means multiple users can use one optical grid simultaneously. In this paper, we propose three new algorithms for the scheduling of multiple optical grid applications onto one optical grid, and one algorithm among these three can make the scheduling order dynamic. In these algorithms, communication contention has been incorporated into scheduling, and arrival time of multiple optical grid applications is assumed to abide by Poisson distribution to simulate multiple users. Our objects of scheduling are not only to make scheduling span short, but also to achieve low unfairness. Impacts of different algorithms are comparatively investigated by simulations.