In the parallel batch schedulingmodel, a group of jobs can be scheduled together as a batch while the processing time of this batch is the greatest processing time among its members; in the model of scheduling with rejection, any job can be rejected with a corresponding penalty cost added to the objective value. In this paper, we present a PTAS for the combined model of the above two scheduling...

We investigate the transient and stationary queue-length distributions of a class of service systems with correlated service times. The classical MX/G/1 queue with semi-Markov service times is the most prominent example in this class and serves as a vehicle to display our results. The sequence of service times is governed by a modulating process J(t). The state of J(·) at a service initiation t...

We study an extension of the delivery dispatching problem (DDP) with time windows, applied on LTL orders arriving at an urban consolidation center. Order properties (e.g., destination, size, dispatch window) may be highly varying, and directly distributing an incoming order batch may yield high costs. Instead, the hub operator may wait to consolidate with future arrivals. A consolidation policy...

We address the batch arrival  systems with finite capacity under partial batch acceptance strategy where service times or rates oscillate between two forms according to the evolution of the number of customers in the system. Applying the theory of Markov regenerative processes and resorting to Markov chain embedding, we present a new algorithm for computing limit distributions of the number cus...

Shanthikumar [10] studied the priority M/G/1 queue with server vacations and found that the difference between the waiting time distribution under the non-preemptive priority and that under the preemptive-resume priority is independent of the vacation policy. We extend this interesting property i) to the generalized vacations which includes the two vacation policies considered by Shanthikumar, ...

A retrial queueing system with two types of batch arrivals, called type I and type II customers, is considered. Type I customers and type II customers arrive in batches of variable sizes according to two different Poisson processes. Service time distributions are identical and independent and are different for both types of customers. If the arriving customers are blocked due to the server bein...

A queueing system with batch Poisson arrivals and single vacations with the exhaustive service discipline is investigated. As the main result the representation for the Laplace transform of the transient queue-size distribution in the system which is empty before the opening is obtained. The approach consists of few stages. Firstly, some results for a “usual” system without vacations correspond...

We study the stochastic optimal control for an assemble-to-order system with multiple products and components that arrive at the system in random batches and according to renewal reward processes. Our purpose is to maximize expected infinite-horizon discounted profit by selecting product prices, component production rates, and a dynamic sequencing rule for assembly. We refine the solution of so...

Multi-link Operation (MLO), arguably the most disruptive feature introduced in IEEE 802.11be, will cater for delay-sensitive applications by using multiple radio interfaces concurrently. In this paper, we analyze delay distribution of MLO under non-saturated traffic. Our results show that upgrading from legacy single-link to successfully contains $95$th percentile as traffic load increases, but...