Search

A tabu search algorithm is developed to solve the problem of forest harvest scheduling that satisfy green-up constraints. The tabu search proves useful in finding solutions to forest harvest scheduling problems. Computational results reveal that tabu search can be utilized to generate good solutions such as generating a harvesting schedule with no green-up violations, low even-flow deviation and which cuts 98.8% of the total volume that could possibly be cut for the problem having 491 blocks and 12 periods.

An important aspect of many societal and institutional processes is the way in which the involved individuals interact. Motivated by work of Conlisk (1976) we formulate a model which allows such interaction among a finite number of individuals. Conditions are established under which our model converges to an approximation suggested by Conlisk as the population becomes infinite. [ABSTRACT FROM AUTHOR]

The well known formula L= λW relates the time-average number in queue to the expected wait in queue of a customer. This paper specializes a more general formula, denoted by H= λG, in order to obtain relations between moments of L and W other than the first. The basic queue considered is G/G/k with stationary input. The special case where the arrival times form a renewal process and the more special case where they are a Poisson process are also discussed. [ABSTRACT FROM AUTHOR]

The wait in a GI/M/k queue is bounded above (stochastically) by the wait in an associated GI/M/1 queue. The analysis of the single server queue is considerably easier than that of the k-server queue, and also the bounds developed for single server queues by J. F. C. Kingman and Kneale T. Marshall can be applied. [ABSTRACT FROM AUTHOR]