in this paper, a multi-product continues review inventory control problem within batch arrival queuing approach (mqr/m/1) is modeled to find the optimal quantities of maximum inventory. the objective function is to minimize summation of ordering, holding and shortage costs under warehouse space, service level, and expected lost-sales shortage cost constraints from retailer and warehouse viewpoi...

because the underlying physiology of pathological tremor in a parkinson's patient is not well understood, the existing physical and drug therapies have not been successful in tremor treatment. different mathematical modeling of such vibration has been introduced to investigate the problem and reduce the existing vibration. most of the models have represented the induced vibration as a sinusoida...

the growth in demand for electric power and the rapid increase in fuel costs, in whole of theworld need to discover new energy resources for electricity production. among of the nonconventionalresources, wind and solar energy, is known as the most promising deviceselectricity production in the future. in this thesis, we study follows to long-term generationscheduling of power systems in the pre...

For the classic dynamic storage allocation problem, we show that knowledge of the durations of the requests is of no great use to an online algorithm in the worst case. This answers an open question posed by Naor, Orda, and Petruschka 5]. More precisely, we show that the competitive ratio of every randomized algorithm against an oblivious adversary is (logx loglogx), where x may be any of sever...

Meta-heuristic algorithms inspired by the natural processes are part of the optimization algorithms that they have been considered in recent years, such as genetic algorithm, particle swarm optimization, ant colony optimization, Firefly algorithm. Recently, a new kind of evolutionary algorithm has been proposed that it is inspired by the human sociopolitical evolution process. This new algorith...

We consider collaborative graph exploration with a set of k agents. All agents start at a common vertex of an initially unknown graph and need to collectively visit all other vertices. We assume agents are deterministic, vertices are distinguishable, moves are simultaneous, and we allow agents to communicate globally. For this setting, we give the first non-trivial lower bounds that bridge the ...