The multi-item joint replenishment problem is generalized to allow ordering costs to be dependent on the specific items jointly supplied. A fixed cycle approach is examined in which all the items of a group are always jointly replenished. A dynamic programming algorithm is developed for...

We consider the situation of a single item having a deterministic, time-varying demand pattern. Production lot sizes, so as to minimize the total of setup and carrying costs, are to be determined subject to production capacity restrictions that can vary with time. Two important theorems...

A heuristic algorithm employing dynamic programming is presented for solving the two-dimensional cutting stock problem where all the small rectangles are of the same dimensions, but without the usual restriction that the cutting be done with "guillotine" cuts, i.e., cut which must be made in...

Managers of research and development (R&D) programs are often confronted with questions of what determines R&D spending (i.e. R&D search intensity) and when R&D spending is unprofitable (i.e. Reservation Technology Level). Three determinants of R&D spending are identified: the current technology...

Technological advances in both the manufacturing and office sectors have emphasized the need to link processors and communications equipment into Local Area Networks (LANs) to facilitate communication and promote resource sharing. Interviews with designers and users of LANs revealed that a...

We develop an optimization procedure for assisting decision-makers in the allocation of resources for cleaning up a specific oil spill. The objective function is to minimize a weighted combination of spill-specific response and damage costs. Inputs to this problem include information about the...

The process of converting a tree into finished lumber involves several interrelated steps. The two of greatest potential for improvement are cutting the felled tree into shorter logs (called bucking the tree) and sawing the bucked logs into lumber. Unlike previous work in the area, this paper...

This paper studies the problem of scheduling jobs on parallel machines with setup times. When a machine switches from processing one type of job to another type, setup times are incurred. The problem is to find a feasible schedule for each machine which maximizes the total reward. We study three...

This paper presents a mathematical model of sequential investment behavior under conditions of uncertainty. The model addresses the problem of an investor with access to a limited pool of capital, who makes sequential decisions on long-lasting investments, under uncertainty as to the timing or...