A framework for facilitating sourcing and allocation decisions for make-to-order items

This paper provides a fundamental building block to facilitate sourcing and allocation decisions for make-to-order items. We specifically address the buyer's vendor selection problem for make-to-order items where the goal is to minimize sourcing and purchasing costs in the presence of fixed costs, shared capacity constraints, and volume-based discounts for bundles of items. The potential suppliers for make-to-order items provide quotes in the form of single sealed bids or participate in a dynamic auction involving open bids. A solution to our problem can be used to determine winning bids amongst the single sealed bids or winners at each stage of a dynamic auction. Due to the computational complexity of this problem, we develop a heuristic procedure based on Lagrangian relaxation technique to solve the problem. The computational results show that the procedure is effective under a variety of scenarios. The average gap across 2,250 problem instances is 4.65%.