In the literature, retrial queues with batch arrivals and heavy-tailed service times have been studied so-called equivalence theorem has established under condition that time is heavier than size. The provides distribution (or tail) between total number of customers in system for queue corresponding standard (non-retrial) queue. this paper, assumption regularly varying tails, we eliminate by al...

This work introduces a MILP reactive scheduling framework for resource-constrained multistage batch facilities with multiple parallel units at each stage. The approach is based on a continuous time domain representation that takes into account the schedule currently in progress, the updated information on the old production orders still to be processed, new order arrivals, the present plant sta...

In the present age of globalization, technology-revolution and sustainable development, the presence of seasonality in tourist arrivals is considered as a key policy issue that affects the global tourism industry by creating instability in the demand and revenues. The seasonal component in a time-series distorts the prediction attempts for policy-making. In this context, it is quintessential to...

In this paper we revisit the Markovian queueing system with a single server, infinite capacity queue and one special skipping policy. Customers arrive in batches but are served by any order. The size of arriving batch becomes known upon its arrival at time instant total number customers is also known. According to adopted policy if batch, which greater than current system, arrives, all currentl...

A polling model with n stations and switchover times is considered. The customers are of n different types, arrive to the system according to the Poisson distribution in batches of random size, and if they find the server unavailable, they start to make retrials until succeed to find a position for service. Each batch may contain customers of different types while the numbers of customers belon...

We consider a finite buffer queue with one deterministic server fed by packets arriving in batches. We assume that we are not able to fully describe the batch distribution: only the maximal size and the average number of packets are supposed known. Indeed, these two quantities are simple to measure in a real system. We additionally allow the batch distribution to be state dependent. We analyze ...

In this paper, we develop a general framework to analyze polling systems with either the autonomous-server or the time-limited service discipline. According to the autonomous-server discipline, the server continues servicing a queue for a certain period of time. According to the time-limited service discipline, the server continues servicing a queue for a certain period of time or until the que...