- Routing to Manage Resolution and Waiting Time in Call Centers with Heterogeneous Servers
- Capacity Maximizing Packet Scheduling Algorithms for Interconnection Networks with Finite Buffers
- Optimizing Quality of Service in Packet Switch Kevin Ross and Nicholas Bambos
- Dynamic Scheduling of Optical Data Bursts in Time-Domain Wavelength Interleaved Networks
- Job Scheduling for Maximal Throughput in Autonomic Computing Systems
- Packet Scheduling Across Networks of Switches Kevin Ross1
- CONE SCHEDULES FOR PROCESSING SYSTEMS IN RANDOM ENVIRONMENTS Kevin Ross1
- Knowledge Management in Call Centers: How Routing Rules Influence Expertise and Service Quality
- Delay Optimization for Airspace Capacity Management with Runtime and Equity Considerations
- Geometry of Packet Switching: Maximal Throughput Cone Scheduling Algorithms
- A PROBABILITY COLLECTIVES APPROACH TO WEIGHTED CLUSTERING ALGORITHMS FOR AD HOC NETWORKS
- Dynamic Quality of Service Control in Packet Switch Scheduling
- PROJECTIVE CONE SCHEDULES IN QUEUEING STRUCTURES; Geometry of Packet Scheduling in Communication Network Switches1
- PROJECTIVE PROCESSING SCHEDULES IN QUEUEING STRUCTURES; Applications to Packet Scheduling in Communication Network Switches
- Adaptive Batch Scheduling for Packet Switching with Delays
- Assistant Professor Technology and Information Management (TIM)
- Int. J. Services and Operations Management, Vol. 4, No. 6, 2008 631 Copyright 2008 Inderscience Enterprises Ltd.
- DYNAMIC SCHEDULING IN QUEUEING SYSTEMS WITH APPLICATIONS TO COMMUNICATION
- Local Search Scheduling Algorithms for Maximal Throughput in Packet Switches
- PROJECTIVE CONE SCHEDULING (PCS) ALGORITHMS FOR PACKET SWITCHES OF MAXIMAL THROUGHPUT
- IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 21, NO. 9, NOVEMBER 2003 1441 Scheduling Bursts in Time-Domain Wavelength
- MANUFACTURING & SERVICE OPERATIONS MANAGEMENT Vol. 00, No. 0, Xxxxx 0000, pp. 000000
- Appendix A: List of Rules In this appendix, we give a detailed description several of the rules that we have analyzed and tested that
- The Impact of Finite Internal Buffers on Network Stability Baskin School of Engineering, University of California, Santa Cruz, CA 95064, ph +1 831-459-1878
- Optimal Service Rules in the Presence of Learning and Forgetting
- Noname manuscript No. (will be inserted by the editor)
- JOURNAL OF AEROSPACE COMPUTING, INFORMATION, AND COMMUNICATION Vol. 7, January 2010
- MANUFACTURING & SERVICE OPERATIONS MANAGEMENT Vol. 00, No. 0, Xxxxx 0000, pp. 000000
- Technical Report UCSC-CRL-07-03: Optimizing Capacity in Interconnection Networks with Finite Buffers
- Noname manuscript No. (will be inserted by the editor)
