This paper develops a method for solving the single product multi-period production-planning problem, in which the production and the inventory costs of each period arc concave and backlogging is not permitted. It is also assumed that the unit variable cost of the production evolves according to a continuous time Markov process. We prove that this production-planning problem can be Stated as a ...

Introduction: One of the major problems of lymphoscintigraphy is the time of patient presence in the nuclear medicine wards. The operating room schedule can be compromised if the patients stay longer than usual in the nuclear medicine departments. However, too early imaging can be falsely negative for sentinel node visualization and delayed imaging may be required. The aim of t...

it is well know that any three impedances or admittances connected into each other in a star form can be easily transformed to a new three impedances or admittances connected into each other in a mesh form. in this paper a generalization of this fact is established and it is shown that in an n + 1 node network which is connected in a form it is always possible to eliminate the center node and o...

Recently, wireless sensor network (WSN) is the popular scope of research. It uses too many applications such as military and non-military. WSN is a base of the Internet of Things (IoT), pervasive computing. It consists of many nodes which are deployed in a specific filed for sense and forward data to the destination node. Routing in WSN is a very important issue because of the limitation of the...

In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...

Some servers are to be located at nodes of a network. Demand for services of these servers is located at each node and a subset of the nodes is to be chosen to locate one server in each. Each customer selects a server with a probability dependent on distance and a certain amount of benefit is achieved after giving service to the customer. Customers may waive receiving service with a known prob...