The Stochastic Eulerian Tour Problem (SETP) seeks the Eulerian tour of minimum expected length on an undirected Eulerian graph, when demand on the arcs that have to be serviced is probabilistic. The SETP is NP-hard and in this paper, we develop three constructive heuristics for this problem. The...

This paper investigates the optimal replenishment policy for multi-item ordering under the conditions of permissible delay in payment, a budget constraint and permissible partial payment at a penalty. Such conditions exist in the use of purchase cards to order merchandise directly from the...

This paper presents a tabu-search heuristic for the capacitated lot-sizing problem (CLSP) with set-up carryover. This production-planning problems allows multiple items to be produced within a time period, and setups for items to be carried over from one period to the next. Two interrelated...

This paper investigates the optimal replenishment policy for multi-item ordering under the conditions of permissible delay in payment, a budget constraint and permissible partial payment at a penalty. Such conditions exist in the use of purchase cards to order merchandise directly from the...