Min. Schemes of Component Allocation in an Assemble-To-Order System

Event Details
  • Date/Time:
    • Friday September 4, 2009
      12:00 pm - 1:00 pm
  • Location: Executive classroom
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    $0.00
  • Extras:
Contact
Anita Race
H. Milton Stewart School of Industrial and Systems Engineering
Contact Anita Race
Summaries

Summary Sentence: Min. Schemes of Component Allocation in an Assemble-To-Order System

Full Summary: Minimization Schemes of Component Allocation in an Assemble-To-Order System

TITLE: Minimization Schemes of Component Allocation in an Assemble-To-Order System

SPEAKER: Dr. Kai Huang

ABSTRACT:

In an Assemble-To-Order (ATO) system, when the components are allocated according to First-Come-First-Serve (FCFS) rules, they may still stay in the inventory due to the lack of other components. Such inventory is called ``random stock". In the existing literature, there is no effective means to count the random stock, so that an exact cost minimization scheme for ATO system is missing. In this paper, we consider a periodic-review ATO system with base stock inventory replenishment policy. We develop a new concept ``multi-matching", which deviates from previous single item matching in the sense that multiple components must be matched with multiple products. Applying this concept, we are able to define a set of product assembly and component allocation decision variables, which allows us to develop a mathematical program that accurately and simultaneously characterizes the entire operational inventory holding cost and backlogging cost, including random stock holding cost.

We show that there exists an inherent network flow structure in this formulation. We also prove that the formulation is equivalent to a second formulation which only contains the product assembly decision. Furthermore, we compare our cost minimization model with an extension of the reward maximization model of Akcay and Xu (2004). Surprisingly, the reward maximization model can be shown to be an approximation of the cost minimization model under given condition. This relationship allows us to define a new set of holding cost and backlogging cost, which leads to a third equivalent formulation. We also explore the structure of the formulations, and propose an enhanced Benders decomposition algorithm. Our numerical experiments show that the behavior of random stock is very different from classical inventory. Moreover, in general the portion of random stock holding cost is significant enough so that it should be included in any exact cost minimization model. This also implies the necessity of non-FCFS component allocation rules in the future study.

This is a joint SCL/DOS seminar.

Additional Information

In Campus Calendar
No
Groups

H. Milton Stewart School of Industrial and Systems Engineering (ISYE)

Invited Audience
No audiences were selected.
Categories
Seminar/Lecture/Colloquium
Keywords
ATO
Status
  • Created By: Anita Race
  • Workflow Status: Published
  • Created On: Oct 12, 2009 - 4:16pm
  • Last Updated: Oct 7, 2016 - 9:46pm