Motivated by a problem faced by a large manufacturer of a consumer product, we explore the interaction between production planning and capacity acquisition decisions in environments with demand growth. We study a firm producing multiple items in a multiperiod environment where demand for items...

We derive a sharp upper bound on the minimal forecast horizon in the discounted dynamic lot size model with constant initial demand. This bound is given by m(m 1), where m is the EOQ's worth, i.e., the number of periods for which the total demand equals Economic Order Quantity. Our results do...

When using a decision support system (DSS) containing a large model base, a user has to decide which specific models are relevant for any particular task. When the model base is large and diverse, this task can be quite difficult. Furthermore, the number and variety of models available can be...

Decision models are often based on certain assumptions as to their validity. Relevant assumptions may include value-based assumptions, such as limitations on the range or values of some input variables or exogenous factors, as well as assumptions about model structure (e.g., linearity). In a...

Most decision support systems (DSS) contain stored data, data analysis procedures, and decision models. However, many DSS have grown to the point that the average end user is presented with a bewildering array of information resources that are difficult to manage in an effective manner. As a...

We consider a finite-horizon, multiechelon inventory system in which the surplus of stock can be sold (i.e., disposed) in the secondary markets at each stage in the system. What are called <i>nested echelon order-up-to policies</i> are shown to be optimal for jointly managing inventory replenishments...

Given the widespread use of the hub and spoke network architecture and its growing importance to competitiveness in logistics, communication, and mass transportation, there has been considerable interest by practitioners and researchers alike in finding efficient methods for designing such...

We address the problem of sequencing jobs, each of which is characterized by one of a large number of possible combinations of customer-specified options, on a paced assembly line. These problems arise frequently in the automotive industry. One job must be launched into the system at equal time...

We consider multimachine scheduling problems with earliness and tardiness costs. We first, analyze problems in which the cost of a job is given by a general nondecreasing, convex function F of the absolute deviation of its completion time from a (common) unrestrictive due-date, and the objective...