The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Traffic Control of Two Parallel Stations Using the Optimal Dynamic Assignment Policy
Abstract
In this chapter, the authors study some optimal dynamic policies of assignment to control the entrance of a system. This system is formed of two waiting lines (queues) in parallel. Every line is composed of a server and a waiting room (buffer). Upon arrival to this system, the authors suppose the existence of an assignment policy. The role of the policy is to assign dynamically the customers (the customers here may represent a physical customer in the entrance of a cinema or bank, packets in a computer networks, calls in a telephone system…etc.) to the one or to the other of two lines or it may reject (or assigned to other system). This assignment is done according to policies in order to achieve some performance criterion.
Related Content
|
Poshan Yu, Zixuan Zhao, Emanuela Hanes.
© 2023.
29 pages.
|
|
Subramaniam Meenakshi Sundaram, Tejaswini R. Murgod, Madhu M. Nayak, Usha Rani Janardhan, Usha Obalanarasimhaiah.
© 2023.
20 pages.
|
|
Rekha R. Nair, Tina Babu, Kishore S..
© 2023.
23 pages.
|
|
Wasswa Shafik.
© 2023.
22 pages.
|
|
Jay Kumar Jain, Dipti Chauhan.
© 2023.
24 pages.
|
|
George Makropoulos, Dimitrios Fragkos, Harilaos Koumaras, Nancy Alonistioti, Alexandros Kaloxylos, Vaios Koumaras, Theoni Dounia, Christos Sakkas, Dimitris Tsolkas.
© 2023.
19 pages.
|
|
Shouvik Sanyal, Kalimuthu M., Thangaraja Arumugam, Aruna R., Balaji J., Ajitha Savarimuthu, Chandan Chavadi, Dhanabalan Thangam, Sendhilkumar Manoharan, Shasikala Patil.
© 2023.
17 pages.
|
|
|