This article,we develop an optimal policy to control the service rate of a discrete time queueing-inventory system with finite buffer.The customers arrive according to a Bernoulli process and the service time for the ...This article,we develop an optimal policy to control the service rate of a discrete time queueing-inventory system with finite buffer.The customers arrive according to a Bernoulli process and the service time for the customers are geometric.Whenever the buffer size attains its maximum,any arriving new customers are considered to be lost.The customers are served one by one according to FCFS rule and each customers request random number of items.The inventory is replenished according to a(s,Q)inventory policy with geometric lead time.The main objectives of this article are to determine the service rates to be employed at each slot so that the long run expected cost rate is minimized for fixed inventory level and fixed buffer size and to minimize the expected waiting time for a fixed inventory level and fixed buffer size.The problems are modelled as Markov decision problem.We establish the existence of a stationary policy and employ linear programming method to find the optimal service rates.We provide some numerical examples to illustrate the behaviour of the model.展开更多
This paper addresses the scheduling problem involving batch processing machines, which is Mso known as parallel batching in the literature. The presented mixed integer programming formulation first provides an elegant...This paper addresses the scheduling problem involving batch processing machines, which is Mso known as parallel batching in the literature. The presented mixed integer programming formulation first provides an elegant model for the problem under study. Fhrthermore, it enables solutions to the problem instances beyond the capability of exact methods developed so far. In order to alleviate computational burden, the authors propose MIP-based heuristic approaches which balance solution quality and computing time.展开更多
基金The research of Ms.L.Iniya is supported by the DST-INSPIRE Fellowship,New Delhi,research award No.DST/INSPIRE Fellowship/[IF190092].
文摘This article,we develop an optimal policy to control the service rate of a discrete time queueing-inventory system with finite buffer.The customers arrive according to a Bernoulli process and the service time for the customers are geometric.Whenever the buffer size attains its maximum,any arriving new customers are considered to be lost.The customers are served one by one according to FCFS rule and each customers request random number of items.The inventory is replenished according to a(s,Q)inventory policy with geometric lead time.The main objectives of this article are to determine the service rates to be employed at each slot so that the long run expected cost rate is minimized for fixed inventory level and fixed buffer size and to minimize the expected waiting time for a fixed inventory level and fixed buffer size.The problems are modelled as Markov decision problem.We establish the existence of a stationary policy and employ linear programming method to find the optimal service rates.We provide some numerical examples to illustrate the behaviour of the model.
文摘This paper addresses the scheduling problem involving batch processing machines, which is Mso known as parallel batching in the literature. The presented mixed integer programming formulation first provides an elegant model for the problem under study. Fhrthermore, it enables solutions to the problem instances beyond the capability of exact methods developed so far. In order to alleviate computational burden, the authors propose MIP-based heuristic approaches which balance solution quality and computing time.
