Tome 35 (2001) no. 1

Sommaire

Bottleneck capacity expansion problems with general budget constraints
p. 1-20
The Lorenz transform approach to the optimal repair-cost limit replacement policy with imperfect repair
p. 21-36
Optimal and near-optimal (s,S) inventory policies for Levy demand processes
p. 37-70
Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
p. 71-83
Multiple routing strategies in a labelled network
p. 85-106
On minimizing total tardiness in a serial batching problem
p. 107-115
Complexity of partial inverse assignment problem and partial inverse cut problem
p. 117-126
Solving the simple plant location problem by genetic algorithm
p. 127-142