In this paper, we use integer programming (IP) to compute minimal forecast horizons for the classical dynamic lot-sizing problem (DLS). As a solution approach for computing forecast horizons, integer programming has been largely ignored by the research community. It is our belief that the...

This paper analyzes the tradeoff between (demand) substitution costs and (production) changeover costs in a discrete-time production-inventory setting using a two-product dynamic lot-sizing model with changeover, inventory carrying, and substitution costs. We first show that the problem is...

Omnichannel firms regularly share information between their multiple channels (e.g., online vs. physical store), i.e., horizontal information sharing, to improve their operational and financial performance. As information often tends to be error-prone -- when it is collected, transmitted, or...

A Dedicated Subnetwork (DSN) refers to a subset of lanes with associated loads in a shipper’s transportation network, for which a fleet of resources – trucks, drivers, and other equipment – is exclusively assigned to carry out all shipping requirements. The resources assigned to a DSN are...

Line extensions – variants of existing products with new appearances, functions, or forms – constitute a significant fraction of products launched each year. While line extensions typically share components with existing products and, therefore, require lower development costs (as compared...

Limited information about the demand for some of the resources needed to produce goods and services (e.g., incomplete and imperfect bills of materials) forces firms to use heuristics when planning resource capacity. We examine the performance of five heuristics: two drawn from practice, two that...