A note on checking schedules with finite horizon
A note on impulsive control of Feller processes with costly information
The paper deals with the optimal inspections and maintenance problem with costly information for a Markov process with positive discount factor. The associated dynamic programming equation is a quasi-variational inequality with first order differential terms. In this paper we study its different formulations: strong, visousity and evolutionary. The case of impulsive control of purely jump Markov processes is studied as a special case.
A Note on Multi-Criteria Inventory Classification Using Weighted Linear Optimization
A note on optimal inventory policies taking account of time value
A note on risk averse newsboy problem
A note on some separable location problems - a multicriterial approach
A Note on Spanning Trees for Network Location Problems
A Note on the Continuous p-Defense-Sum Problem
A note on the convexity of the expected queue length of the queue with respect to the arrival rate: A third proof.
A note on the optimal replacement policy
A system with a single activated unit, which can be in a finite number of states, is considered. Inspections of the system are carried out at discrete time instants. It is possible to replace it by a new one at these moments. The user of the system, by setting down conditions of replacements, wants to maximize his gain, which does not include the rest value of units. On a numerical example it is shown that the frequency of replacements of the unit need not be the greater the longer is the period...
A Note on the p−Center Problem
A note on two inventory models.
A Note On Two-Units Standby Systems
A note to D. Gale's productivity
A note to independent sets in scheduling
The paper studies the bus-journey graphs in the case when they are piecewise expanding and contracting (if described by fathers-sons relations starting with the greatest independent set of nodes). This approach can make it possible to solve the minimization problem of the total service time of crews.
A paradox in a queueing network with state-dependent routing and loss.
A Parametric Visualization Software for the Assignment Problem
A Periodic Loading Policy for A Flexible Transfer Line: Development And Simulation Assessment
A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem
This paper presents a hybrid schedule generation scheme for solving the resource-constrained project scheduling problem. The scheme, which is called the Polarized Adaptive Scheduling Scheme (PASS), can operate in a spectrum between two poles, namely the parallel and serial schedule generation schemes. A polarizer parameter in the range between zero and one indicates how similarly the PASS behaves like each of its two poles. The presented hybrid is...
A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem
This paper presents a hybrid schedule generation scheme for solving the resource-constrained project scheduling problem. The scheme, which is called the Polarized Adaptive Scheduling Scheme (PASS), can operate in a spectrum between two poles, namely the parallel and serial schedule generation schemes. A polarizer parameter in the range between zero and one indicates how similarly the PASS behaves like each of its two poles. The presented hybrid is...