ecms_neu_mini.png

Digital Library

of the European Council for Modelling and Simulation

 

Title:

Minimizing Mean Response Time In Batch-Arrival Non-Observable Systems With Single-Server FIFO Queues Operating In Parallel

Authors:

Mikhail Konovalov, Rostislav Razumchik

Published in:

 

 

(2021). ECMS 2021, 35th Proceedings
Edited by: Khalid Al-Begain, Mauro Iacono, Lelio Campanile, Andrzej Bargiela, European Council for Modelling and Simulation.

 

DOI: http://doi.org/10.7148/2021

ISSN: 2522-2422 (ONLINE)

ISSN: 2522-2414 (PRINT)

ISSN: 2522-2430 (CD-ROM)

 

ISBN: 978-3-937436-72-2
ISBN: 978-3-937436-73-9(CD)

 

Communications of the ECMS , Volume 35, Issue 1, June 2021,

United Kingdom

 

Citation format:

Mikhail Konovalov, Rostislav Razumchik (2021). Minimizing Mean Response Time In Batch-Arrival Non-Observable Systems With Single-Server FIFO Queues Operating In Parallel, ECMS 2021 Proceedings Edited By: Khalid Al-Begain, Mauro Iacono, Lelio Campanile, Andrzej Bargiela European Council for Modeling and Simulation. doi: 10.7148/2021-0272

DOI:

https://doi.org/10.7148/2021-0272

Abstract:

Consideration is given to a dispatching system, where jobs, arriving in batches, cannot be stored and thus must be immediately routed to single-server FIFO queues operating in parallel. The dispatcher can memorize its routing decisions but at any time instant does not have any system's state information. The only information available is the batch/job size and inter-arrival time distributions, and the servers' service rates. Under these conditions, one is interested in the routing policies which minimize the job's long-run mean response time. The single-parameter routing policy is being proposed which, according to the numerical experiments, outperforms  best routing rules known by now for non-observable dispatching systems: probabilistic and deterministic. Both the batch-wise and job-wise assignments are studied. Extension to systems with unreliable servers is also addressed.

Full text: