Article ID: | iaor20051323 |
Country: | United Kingdom |
Volume: | 55 |
Issue: | 6 |
Start Page Number: | 630 |
End Page Number: | 639 |
Publication Date: | Jun 2004 |
Journal: | Journal of the Operational Research Society |
Authors: | Sung C.S., Rim H.C. |
Keywords: | communications, programming: dynamic |
This paper considers a receiver set partitioning and sequencing problem in a wavelength division multiplexing single-hop lightwave network for multicasting traffic. The problem is analysed in the approach of uncapacitated single batch-processing machine scheduling. In the analysis, several solution properties are characterized with respect to a mean flow time measure, based upon which two heuristic algorithms are developed, along with a dynamic programming algorithm. Several numerical experiments show that the heuristic algorithms generate good schedules. The problem is extended to consider two measures simultaneously including the mean flow time and the number of transmissions, for which the proposed algorithms also perform well.