References

Anderson, T.E., S.S. Owicki, J.B. Saxe and C.P. Thacker, 1993. High speed switch scheduling for local area networks. ACM Trans. Comput. Syst., 11: 319-352.
CrossRef  |  Direct Link  |  

Chakraborty, G. and Y. Hirano, 1998. Genetic algorithm for broadcast scheduling in packet radio networks. Proceedings of the 1998 IEEE International Conference on Evolutionary Computation IEEE World Congress on Computational Intelligence, May 4-9, 1998, Anchorage, AK., pp: 183-188.

Chuang, S.T., A. Goel, N. Mckeown and B. Prabhakar, 1999. Matchingoutput queueing with a comibed input/output-queued switch. IEEE J. Sel. Area Commun., 17: 1030-1039.
CrossRef  |  

Demers, A., S. Keshan and S. Shenker, 1989. Analysis and simulation of a fair queueing algorithm. Proceedings of the SIGCOMM'89 Symposium on Communications Architecture and Protocols, September 1989, New York, USA., pp: 1-12.

Duan, H., J.W. Lockwood and S.M. Kang, 1998. Matrix unit cell scheduler mucs for input-buffered ATM switches. IEEE Commun. Lett., 2: 20-23.
Direct Link  |  

Gomes, M.C., A.P. Barbosa-Povoa and A.Q. Novais, 2005. Optimal scheduling for flexible job shop operations. Int. J. Prod. Res., 43: 2323-2353.
CrossRef  |  

Jin, Y., J. Zhang and W. Hu, 2005. A Genetic Algorithm of High-Throughput and Low-Jitter Scheduling for Input-Queued Switches. In: Advances in Natural Computation, Wang, L., K. Chen and Y.S. Ong (Eds.). LN CS 3612, Springer, Berlin, Heidelberg, ISBN-13: 978-3-540-28320-1, pp: 102-111.

Kumar, N., R. Pan and D. Shah, 2004. Fair scheduling in input-queued switches under inadmissible traffic. Proceedings of the IEEE Global Telecommunications Conference, November 29-December 3, 2004, IEEE Communications Society, USA., pp: 1713-1717.

Marsan, M., A. Bianco, E. Leonardi and L. Milia, 1999. RPA: A flexible scheduling algorithm for input buffered switches. J. Commun. IEEE Trans., 47: 1921-1933.
CrossRef  |  

McKeown, N., 1995. Scheduling algorithms for input-queued cell switches. Ph.D. Thesis, UC Berkeley

McKeown, N., 1999. The iSLIP scheduling algorithm for input-queued switches. Networking IEEE/ACM Trans., 7: 188-201.
CrossRef  |  

Mekkittikul, A. and N. McKeown, 1996. A starvation free algorithm for achieving 100% throughput in an input queued switch. Proceedings of the 5th International Conference on Computer Communications and Networks, October 16-19, 1996, Rockville, MA., pp: 226-229.

Mekkittikul, A. and N. McKeown, 1998. A practical scheduling algorithm to achieve 100% throughput in input-queued switches. Proc. INFOCOM Annu. Joint Conf. IEEE Comput. Commun. Soc., 2: 792-799.
CrossRef  |  

Murovec, B. and P. Suhel, 2004. A repairing technique for the local search of the job-shop problem. Eur. J. Operat. Res., 153: 220-238.
CrossRef  |  

Nong, G., J.K. Muppala and M. Hamdi, 1999. Analysis of non blocking ATM switches with multiple input queues. Networking IEEE/ACM Trans., 7: 60-74.
CrossRef  |  

Parkeh, A.K. and R.G. Gallager, 1993. A generalized processor sharing approach to flow control in integrated services networks: The single-node case. Networking IEEE/ACM Trans., 1: 344-357.
CrossRef  |  

Serpanos, D.N. and P.I. Antoniadis, 2000. FIRM: A class of distributed scheduling algorithms for high-speed atm switches with multiple input queues. Proc. IEEE INFOCOM Annu. Joint Conf. IEEE Comput. Communi. Soc., 2: 548-555.
CrossRef  |  

Shah, D., P. Giaccone and B. Prabhakar, 2002. An efficient randomized algorithms for input-queued switch scheduling. Micro IEEE, 22: 10-18.
CrossRef  |  

Shreedhar, M. and G. Varghese, 1995. Efficient fair queueing using deficit round robin. Proceedings of the Conference on Appplications, Technologies, Architectures and Protocols for Computer Communication, October 1995, New York, USA., pp: 231-242.

Tassisulas, L., 1998. Linear complexity algorithms for maximum throughput in radio networks and input queued switches. INFOCOM 98. Seventeenth, 2: 533-539.
CrossRef  |